A local convergence property of primal-dual methods for nonlinear programming
From MaRDI portal
Publication:948957
DOI10.1007/s10107-007-0136-2zbMath1167.65031OpenAlexW2101337987MaRDI QIDQ948957
Publication date: 16 October 2008
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-007-0136-2
convergencenumerical exampleprimal-dual methodinterior point methodlocal convergenceNewton-type methodpenalty parameterconstrained nonlinear programming
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Interior-point methods (90C51)
Related Items
Learning to steer nonlinear interior-point methods, Portfolio optimization with entropic value-at-risk, Local path-following property of inexact interior methods in nonlinear programming, Rapid infeasibility detection in a mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization, Local convergence analysis of a primal-dual method for bound-constrained optimization without SOSC, A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs, From global to local convergence of interior methods for nonlinear optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dynamic updates of the barrier parameter in primal-dual methods for nonlinear programming
- An interior-point algorithm for nonconvex nonlinear programming
- On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds
- Superlinear and quadratic convergence of some primal - dual interior point methods for constrained optimization
- Local convergence of the affine-scaling interior-point algorithm for nonlinear programming
- A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization
- Local convergence of a primal-dual method for degenerate nonlinear programming
- Componentwise fast convergence in the solution of full-rank systems of nonlinear equations
- A globally convergent primal-dual interior-point filter method for nonlinear programming
- On the characterization of \(Q\)-superlinear convergence of quasi-Newton interior-point methods for nonlinear programming
- On the formulation and theory of the Newton interior-point method for nonlinear programming
- Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- An interior algorithm for nonlinear optimization that combines line search and trust region steps
- Superlinear Convergence of Primal-Dual Interior Point Algorithms for Nonlinear Programming
- Adaptive Barrier Update Strategies for Nonlinear Interior Methods
- Numerical Stability and Efficiency of Penalty Algorithms
- Q-SUPERLINEAR CONVERGENCE OF PRIMAL-DUAL INTERIOR POINT QUASI-NEWTON METHODS FOR CONSTRAINED OPTIMIZATION
- A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties
- On the superlinear convergence order of the logarithmic barrier algorithm
