Primal-Dual and Primal Interior Point Algorithms for General Nonlinear Programs
From MaRDI portal
Publication:4896436
DOI10.1287/IJOC.7.3.321zbMATH Open0859.90111OpenAlexW2127959492MaRDI QIDQ4896436FDOQ4896436
Authors: Leon Lasdon, Gang Yu, John Plummer
Publication date: 10 April 1997
Published in: ORSA Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.7.3.321
Recommendations
inequality constraintsNewton's methodinterior point algorithmKuhn-Tucker systemequality constrained barrier problem
Cited In (12)
- Superlinear and quadratic convergence of some primal - dual interior point methods for constrained optimization
- A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs
- A T-Algebraic Approach to Primal-Dual Interior-Point Algorithms
- Title not available (Why is that?)
- A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computational experience with a safeguarded barrier algorithm for sparse nonlinear programming
- A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs
- Primal-dual potential reduction algorithm for symmetric programming problems with nonlinear objective functions
- On the global convergence of a modified augmented Lagrangian linesearch interior-point Newton method for nonlinear programming
- A primal–dual interior point algorithm with an exact and differentiable merit function for nonlinear programming
This page was built for publication: Primal-Dual and Primal Interior Point Algorithms for General Nonlinear Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4896436)