Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Método punto interior")

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 1179

  • Page / 48
Export

Selection :

  • and

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

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

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

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

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

Optimal ellipsoidal approximations around the analytic centerJARRE, F.Applied mathematics & optimization. 1994, Vol 30, Num 1, pp 15-19, issn 0095-4616Article

Sur l'implantation des méthodes de points intérieurs pour la programmation linéaire = On the implementation of interior point methods for linear programmingVeiga, Geraldo; Plateau, Gérard.1997, 232 p.Thesis

Free material optimization via mathematical programmingZOWE, J; KOCVARA, M; BENDSØE, M. P et al.Mathematical programming. 1997, Vol 79, Num 1-3, pp 445-466, issn 0025-5610Conference Paper

Méthodes hybrides en programmation linéaire = Hybrid Methods for Linear ProgrammingMainka, Jérome; Tolla, P.1996, 214 p.Thesis

A study of indicators for identifying zero variables in interior-point methodsEL-BAKRY, A. S; TAPIA, R. A; ZHANG, Y et al.SIAM review (Print). 1994, Vol 36, Num 1, pp 45-72, issn 0036-1445Article

Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programmingTODD, M. J; YINYU YE.Mathematical programming. 1998, Vol 81, Num 1, pp 1-21, issn 0025-5610Article

Advanced Economic Dispatching Control algorithm using dynamic unit model and Interior Point MethodTANIMOTO, M; IZUI, Y; HIROSE, K et al.IEE conference publication. 1998, pp 796-801, issn 0537-9989, isbn 0-85296-912-0, 2VolConference Paper

Interior-point methods : An old and new approach to nonlinear programmingNESTEROV, YU.Mathematical programming. 1997, Vol 79, Num 1-3, pp 285-297, issn 0025-5610Conference Paper

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

Smoothed analysis of condition numbers and complexity implications for linear programmingDUNAGAN, John; SPIELMAN, Daniel A; TENG, Shang-Hua et al.Mathematical programming (Print). 2011, Vol 126, Num 2, pp 315-350, issn 0025-5610, 36 p.Article

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 QMR-based interior-point algorithm for solving linear programsFREUND, R. W; JARRE, F.Mathematical programming. 1997, Vol 76, Num 1, pp 183-210, issn 0025-5610Conference Paper

  • Page / 48