Treatment of inequality constraints in power system state estimation. DiscussionCLEMENTS, K. A; DAVIS, P. W; FREY, K. D et al.IEEE transactions on power systems. 1995, Vol 10, Num 2, pp 567-574, issn 0885-8950Conference Paper

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

Polynomiality of an inexact infeasible interior point algorithm for semidefinite programmingGUANGLU ZHOU; TOH, Kim-Chuan.Mathematical programming. 2004, Vol 99, Num 2, pp 261-282, issn 0025-5610, 22 p.Article

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

Formulating two-stage stochastic programs for interior point methodsLUSTIG, I. J; MULVEY, J. M; CARPENTIER, T. J et al.Operations research. 1991, Vol 39, Num 5, pp 757-770, issn 0030-364XArticle

An optimal-basis identification technique for interior-point linear programming algorithmsTAPIA, R. A; YIN ZHANG.Linear algebra and its applications. 1991, Vol 152, pp 343-363, issn 0024-3795Article

Computational experience with a primal-dual interior point method for linear programmingLUSTIG, I. J; MARSTEN, R. E; SHANNO, D. F et al.Linear algebra and its applications. 1991, Vol 152, pp 191-222, issn 0024-3795Article

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

Superlinear convergence of the affine scaling algorithmTSUCHIYA, T; MONTEIRO, R. D. C.Mathematical programming. 1996, Vol 75, Num 1, pp 77-110, issn 0025-5610Article

On solution-containing ellipsoids in linear programmingCHOI, I. C; GOLDFARB, D.Journal of optimization theory and applications. 1994, Vol 80, Num 1, pp 161-173, issn 0022-3239Article

Prior reduced fill-in in solving equations in interior point algorithmsBIRGE, J. R; FREUND, R. M; VANDERBEI, R et al.Operations research letters. 1992, Vol 11, Num 4, pp 195-198, issn 0167-6377Article

The relation between the path of centers and smale's regularization of the linear programming problemMASAKAZU KOJIMA; NIMROD MEGIDDO.Linear algebra and its applications. 1991, Vol 152, pp 135-139, issn 0024-3795Article

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

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