scientific article
From MaRDI portal
Publication:3840106
zbMath0908.90236MaRDI QIDQ3840106
David M. Gay, Michael L. Overton, Margaret H. Wright
Publication date: 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
primal-dual methodmerit functionnonconvex nonlinear programmingLagrange multiplier estimatesprimal-dual interior methods
Related Items (26)
A truncated Newton method in an augmented Lagrangian framework for nonlinear programming ⋮ Primal-dual nonlinear rescaling method for convex optimization ⋮ The interior-point revolution in optimization: History, recent developments, and lasting consequences ⋮ A note on the use of vector barrier parameters for interior-point methods ⋮ Using improved directions of negative curvature for the solution of bound-constrained nonconvex problems ⋮ Newton-KKT interior-point methods for indefinite quadratic programming ⋮ Shakedown analysis with multidimensional loading spaces ⋮ Simultaneous solution approaches for large optimization problems. ⋮ The flattened aggregate constraint homotopy method for nonlinear programming problems with many nonlinear constraints ⋮ Global convergence of slanting filter methods for nonlinear programming ⋮ A primal-dual modified log-barrier method for inequality constrained nonlinear optimization ⋮ A local convergence property of primal-dual methods for nonlinear programming ⋮ An interior-point algorithm for nonlinear minimax problems ⋮ On the solution of NP-hard linear complementarity problems ⋮ Primal-dual nonlinear rescaling method with dynamic scaling parameter update ⋮ Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties ⋮ Examples of ill-behaved central paths in convex optimization ⋮ Dynamic updates of the barrier parameter in primal-dual methods for nonlinear programming ⋮ Optimal shape design in biomimetics based on homogenization and adaptivity ⋮ A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs ⋮ A primal-dual interior-point algorithm for nonlinear least squares constrained problems ⋮ Globally convergent interior-point algorithm for nonlinear programming ⋮ Global convergence analysis of line search interior-point methods for nonlinear programming without regularity assumptions ⋮ Global convergence enhancement of classical linesearch interior point methods for MCPs ⋮ Primal-dual Newton-type interior-point method for topology optimization ⋮ An interior method for nonconvex semidefinite programs
Uses Software
This page was built for publication:
