Convergence analysis of a nonlinear Lagrangian algorithm for nonlinear programming with inequality constraints
From MaRDI portal
Publication:1429323
DOI10.1007/BF02936070zbMath1044.90079OpenAlexW1976652812MaRDI QIDQ1429323
Publication date: 18 May 2004
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02936070
Related Items (7)
δ-mapping algorithm and its application in traffic flow problems with inhomogeneities ⋮ Analysis of a smoothing method for symmetric conic linear programming ⋮ Properties of the augmented Lagrangian in nonlinear semidefinite optimization ⋮ A CLASS OF NONLINEAR LAGRANGIANS: THEORY AND ALGORITHM ⋮ Sub-quadratic convergence of a smoothing Newton method for second-order cone programming ⋮ Analysis of a non-interior continuation method for second-order cone programming ⋮ Optimization model and algorithm of the trajectory of horizontal well with perturbation
Cites Work
- Modified barrier functions (theory and methods)
- Superlinear and quadratic convergence of some primal - dual interior point methods for constrained optimization
- On the formulation and theory of the Newton interior-point method for nonlinear programming
- Q-SUPERLINEAR CONVERGENCE OF PRIMAL-DUAL INTERIOR POINT QUASI-NEWTON METHODS FOR CONSTRAINED OPTIMIZATION
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Convergence analysis of a nonlinear Lagrangian algorithm for nonlinear programming with inequality constraints