Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Interior point method")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 1282

  • Page / 52
Export

Selection :

  • and

Recovering an optimal LP basis from an optimal dual solutionBEN AMOR, Hatem; DESROSIERS, Jacques; SOUMIS, Francois et al.Operations research letters. 2006, Vol 34, Num 5, pp 569-576, issn 0167-6377, 8 p.Article

A NEW O(√nL) ITERATION LARGE-UPDATE PRIMAL-DUAL INTERIOR-POINT METHOD FOR SECOND-ORDER CONE PROGRAMMINGZENGZHE FENG.Numerical functional analysis and optimization. 2012, Vol 33, Num 4-6, pp 397-414, issn 0163-0563, 18 p.Article

Interior Point Methods for Nonlinear OptimizationPOLIK, Imre; TERLAKY, Tamás.Lecture notes in mathematics. 2010, Vol 1989, pp 215-276, issn 0075-8434, isbn 978-3-642-11338-3, 1Vol, 62 p.Conference Paper

A generalized homogeneous and self-dual algorithm for linear programmingXIAOJIE XU; YINYU YE.Operations research letters. 1995, Vol 17, Num 4, pp 181-190, issn 0167-6377Article

Interior point methods in theory and practiceANSTREICHER, Kurt.Mathematical programming. 1997, Vol 76, Num 1, issn 0025-5610, 264 p.Conference Proceedings

The role of the augmented system in interior point methodsMAROS, I; MESZAROS, C.European journal of operational research. 1998, Vol 107, Num 3, pp 720-736, issn 0377-2217Article

Interior point optimization and limit analysis: an applicationPASTOR, Joseph; THAI, The-Hung; FRANCESCATO, Pascal et al.Communications in numerical methods in engineering. 2003, Vol 19, Num 10, pp 779-785, issn 1069-8299, 7 p.Article

Polynomial time solvability of non-symmetric semidefinite programmingHU, Sheng-Long; HUANG, Zheng-Hai.Operations research letters. 2010, Vol 38, Num 5, pp 358-360, issn 0167-6377, 3 p.Article

An e-sensitivity analysis for semidefinite programmingLIM, Sungmook; LEE, Sangwook; PARK, Soondal et al.European journal of operational research. 2005, Vol 164, Num 2, pp 417-422, issn 0377-2217, 6 p.Article

The simplex and projective scaling algorithms as iteratively reweighted least squares methodsSTONE, R. E; TOVEY, C. A.SIAM review (Print). 1991, Vol 33, Num 2, pp 220-237, issn 0036-1445, 18 p.Article

Sensitivity analysis in linear optimization : Invariant support set intervals : Advances in continuous optimizationALIREZA GHAFFARI HADIGHEH; TERLAKY, Tamas.European journal of operational research. 2006, Vol 169, Num 3, pp 1158-1175, issn 0377-2217, 18 p.Conference Paper

A homotopy method for getting a local minimum of constrained nonconvex programmingWENJUAN SUN; QINGHUAI LIU; CAILING WANG et al.Nonlinear analysis. 2009, Vol 71, Num 10, pp 4725-4731, issn 0362-546X, 7 p.Article

Steplength selection in interior-point methods for quadratic programmingCURTIS, Frank; NOCEDAL, Jorge.Applied mathematics letters. 2007, Vol 20, Num 5, pp 516-523, issn 0893-9659, 8 p.Article

Degeneracy degrees of constraint collectionsSIERKSMA, Gerard; TIJSSEN, Gert A.Mathematical methods of operations research (Heidelberg). 2003, Vol 57, Num 3, pp 437-448, issn 1432-2994, 12 p.Article

A modified algorithm for the strict feasibility problemBENTERKI, D; MERIKHI, B.Operations research. 2001, Vol 35, Num 4, pp 395-399Article

An O(√nL)-iteration homogeneous and self-dual linear programming algorithmYINYU YE; TODD, M. J; MIZUNO, S et al.Mathematics of operations research. 1994, Vol 19, Num 1, pp 53-67, issn 0364-765XArticle

Superlinear convergence of infeasible-interior-point methods for linear programmingYIN ZHANG; DETEON ZHANG.Mathematical programming. 1994, Vol 66, Num 3, pp 361-377, issn 0025-5610Article

On the big M in the affine scaling algorithmISHIHARA, T; KOJIMA, M.Mathematical programming. 1993, Vol 62, Num 1, pp 85-93, issn 0025-5610Article

On Anstreicher's combined phase I-phase II projective algorithm for linear programmingTODD, M. J.Mathematical programming. 1992, Vol 55, Num 1, pp 1-15, issn 0025-5610Article

Degenerate crossing numbersPACH, Janos; TOTH, Geza.SCG : symposium on computational geometry. 2006, pp 255-258, isbn 1-59593-340-9, 1Vol, 4 p.Conference Paper

Interior-point methods for reduced Hessian successive quadratic programmingTERNET, D. J; BIEGLER, L. T.Computers & chemical engineering. 1999, Vol 23, Num 7, pp 859-873, issn 0098-1354Article

Balinski-Tucker simplex tableaus : Dimensions, degeneracy degrees, and interior points of optimal facesTIJSSEN, G. A; SIERKSMA, G.Mathematical programming. 1998, Vol 81, Num 3, pp 349-372, issn 0025-5610Article

A general parametric analysis approach and its implication to sensitivity analysis in interior point methodsMONTEIRO, R. D. C; MEHROTRA, S.Mathematical programming. 1996, Vol 72, Num 1, pp 65-82, issn 0025-5610Article

Quadratic convergence of the Iri-Imai algorithm for degenerate linear programming problemsTSUCHIYA, T.Journal of optimization theory and applications. 1995, Vol 87, Num 3, pp 703-726, issn 0022-3239Article

An interior-point method for generalized linear-fractional programmingNESTEROV, YU. E; NEMIROVSKII, A. S.Mathematical programming. 1995, Vol 69, Num 1, pp 177-204, issn 0025-5610Article

  • Page / 52