General primal-dual penalty/barrier path-following Newton methods for nonlinear programming
From MaRDI portal
Publication:3534650
DOI10.1080/02331930500342658zbMATH Open1147.90413OpenAlexW2094730756MaRDI QIDQ3534650FDOQ3534650
Authors: M. Zadlo, Christian Grossmann 
Publication date: 4 November 2008
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331930500342658
Recommendations
- A general class of penalty/barrier path-following Newton methods for nonlinear programming
- scientific article; zbMATH DE number 1594503
- Penalty/barrier path-following in linearly constrained optimization
- Primal-Dual Interior Methods for Nonconvex Nonlinear Programming
- Path-following barrier and penalty methods for linearly constrained problems
Cites Work
- Title not available (Why is that?)
- Self-regular functions and new search directions for linear and semidefinite optimization
- More test examples for nonlinear programming codes
- Interior Methods for Nonlinear Optimization
- Penalty and Barrier Methods: A Unified Framework
- Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming
- Primal-Dual Interior Methods for Nonconvex Nonlinear Programming
- Path-following barrier and penalty methods for linearly constrained problems
- Interior-point methods for nonconvex nonlinear programming: jamming and numerical testing
- A sufficient condition for self-concordance, with application to some classes of structured convex programming problems
- Superlinear convergence of primal-dual interior point algorithms for nonlinear programming
- A Noninterior Continuation Method for Quadratic and Linear Programming
- Effects of finite-precision arithmetic on interior-point methods for nonlinear programming
- Inexact primal-dual interior point iteration for linear programs in function spaces
- A general class of penalty/barrier path-following Newton methods for nonlinear programming
- Asymptotic analysis of a path-following barrier method for linearly constrained convex problems*
Cited In (12)
- A general class of penalty/barrier path-following Newton methods for nonlinear programming
- On the superlinear convergence order of the logarithmic barrier algorithm
- A shifted primal-dual penalty-barrier method for nonlinear optimization
- Title not available (Why is that?)
- Differentiable local barrier-penalty paths
- Penalty/barrier path-following in linearly constrained optimization
- Title not available (Why is that?)
- Dynamic updates of the barrier parameter in primal-dual methods for nonlinear programming
- Mesh-independent convergence of penalty methods applied to optimal control with partial differential equations
- A smoothed penalty iteration for state constrained optimal control problems for partial differential equations
- Penalty and Barrier Methods: A Unified Framework
- Why a Pure Primal Newton Barrier Step May be Infeasible
This page was built for publication: General primal-dual penalty/barrier path-following Newton methods for nonlinear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3534650)
