scientific article; zbMATH DE number 1186888

MaRDI QIDQ3840106zbMATH OpenFDO

Authors David M. Gay, Michael L. Overton, Margaret H. Wright

Publication date 1998

zbMATH Keywords

Lagrange multiplier estimatesmerit functionnonconvex nonlinear programmingprimal-dual interior methodsprimal-dual method

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Recommendations

• Primal-Dual Interior Methods for Nonconvex Nonlinear Programming
• scientific article; zbMATH DE number 5630197
• An interior-point algorithm for nonconvex nonlinear programming
• Superlinear convergence of primal-dual interior point algorithms for nonlinear programming

Cited in

(36)

• Simultaneous solution approaches for large optimization problems.
• Interior-point methods for nonconvex nonlinear programming: orderings and higher-order methods
• Using improved directions of negative curvature for the solution of bound-constrained nonconvex problems
• The flattened aggregate constraint homotopy method for nonlinear programming problems with many nonlinear constraints
• Examples of ill-behaved central paths in convex optimization
• Optimal shape design in biomimetics based on homogenization and adaptivity
• 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
• A primal-dual modified log-barrier method for inequality constrained nonlinear optimization
• A truncated Newton method in an augmented Lagrangian framework for nonlinear programming
• Primal-dual nonlinear rescaling method with dynamic scaling parameter update
• Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties
• 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
• A primal-dual interior point method with parameter perturbation for solving a class of general nonlinear programming problems
• A Primal-Dual Exterior Point Method for Nonlinear Optimization
• scientific article; zbMATH DE number 4145673 (Why is no real title available?)
• A primal–dual interior point method for nonlinear optimization over second-order cones
• scientific article; zbMATH DE number 5630197 (Why is no real title available?)
• Primal-Dual Interior Methods for Nonconvex Nonlinear Programming
• Shakedown analysis with multidimensional loading spaces
• scientific article; zbMATH DE number 724216 (Why is no real title available?)
• A primal–dual interior point algorithm with an exact and differentiable merit function for nonlinear programming
• The interior-point revolution in optimization: History, recent developments, and lasting consequences
• A primal–dual penalty method via rounded weighted-ℓ₁ Lagrangian duality
• On the solution of NP-hard linear complementarity problems
• Dynamic updates of the barrier parameter in primal-dual methods for nonlinear programming
• A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs
• Primal-dual nonlinear rescaling method for convex optimization
• A note on the use of vector barrier parameters for interior-point methods
• Newton-KKT interior-point methods for indefinite quadratic programming
• Global convergence of slanting filter methods for nonlinear programming
• A local convergence property of primal-dual methods for nonlinear programming
• An interior-point algorithm for nonlinear minimax problems

Describes a project that uses

Uses Software

• CUTEr

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3840106)