General primal-dual penalty/barrier path-following Newton methods for nonlinear programming
From MaRDI portal
Publication:3534650
DOI10.1080/02331930500342658zbMath1147.90413OpenAlexW2094730756MaRDI QIDQ3534650
Publication date: 4 November 2008
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331930500342658
Related Items (2)
A smoothed penalty iteration for state constrained optimal control problems for partial differential equations ⋮ Mesh-independent convergence of penalty methods applied to optimal control with partial differential equations
Cites Work
- Unnamed Item
- More test examples for nonlinear programming codes
- Interior-point methods for nonconvex nonlinear programming: jamming and numerical testing
- Self-regular functions and new search directions for linear and semidefinite optimization
- Inexact primal-dual interior point iteration for linear programs in function spaces
- A sufficient condition for self-concordance, with application to some classes of structured convex programming problems
- Path-following barrier and penalty methods for linearly constrained problems
- Superlinear Convergence of Primal-Dual Interior Point Algorithms for Nonlinear Programming
- Effects of Finite-Precision Arithmetic on Interior-Point Methods for Nonlinear Programming
- A Noninterior Continuation Method for Quadratic and Linear Programming
- Primal-Dual Interior Methods for Nonconvex Nonlinear Programming
- Asymptotic analysis of a path-following barrier method for linearly constrained convex problems*
- Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming
- A general class of penalty/barrier path-following Newton methods for nonlinear programming
- Interior Methods for Nonlinear Optimization
- Penalty and Barrier Methods: A Unified Framework
This page was built for publication: General primal-dual penalty/barrier path-following Newton methods for nonlinear programming
