Primal-Dual Interior Methods for Nonconvex Nonlinear Programming
From MaRDI portal
Publication:4229467
DOI10.1137/S1052623496305560zbMath0915.90236MaRDI QIDQ4229467
Philip E. Gill, Anders Forsgren
Publication date: 22 February 1999
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
nonlinear programmingconstrained minimizationpenalty methodsprimal-dual methodsbarrier methodsmodified Newton methodsinterior methods
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
Feasible methods for nonconvex nonsmooth problems with applications in green communications, Assessing a multiple QTL search using the variance component model, A truncated Newton method in an augmented Lagrangian framework for nonlinear programming, A globally convergent regularized interior point method for constrained optimization, Primal-dual nonlinear rescaling method for convex optimization, A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm, Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale nonconvex interior-point optimization, Shifted L-BFGS systems, The interior-point revolution in optimization: History, recent developments, and lasting consequences, Using improved directions of negative curvature for the solution of bound-constrained nonconvex problems, Newton-KKT interior-point methods for indefinite quadratic programming, An augmented Lagrangian method for equality constrained optimization with rapid infeasibility detection capabilities, An interior point method for nonlinear optimization with a quasi-tangential subproblem, A Stabilized Sequential Quadratic Programming Method for Optimization Problems in Function Spaces, A spline smoothing homotopy method for nonlinear programming problems with both inequality and equality constraints, Alternating Optimization Method for Isogeometric Topology Optimization with Stress Constraints, A Sparsity Preserving Convexification Procedure for Indefinite Quadratic Programs Arising in Direct Optimal Control, A primal-dual augmented Lagrangian, A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties, General primal-dual penalty/barrier path-following Newton methods for nonlinear programming, The flattened aggregate constraint homotopy method for nonlinear programming problems with many nonlinear constraints, Study of a primal-dual algorithm for equality constrained minimization, A primal-dual modified log-barrier method for inequality constrained nonlinear optimization, Primal-dual active-set methods for large-scale optimization, Component-wise reduced order model lattice-type structure design, A stabilized SQP method: superlinear convergence, Primal-dual interior-point method for thermodynamic gas-particle partitioning, On the global convergence of a modified augmented Lagrangian linesearch interior-point Newton method for nonlinear programming, Primal-dual nonlinear rescaling method with dynamic scaling parameter update, An interior algorithm for nonlinear optimization that combines line search and trust region steps, Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties, A general class of penalty/barrier path-following Newton methods for nonlinear programming, Examples of ill-behaved central paths in convex optimization, Approximate solution of system of equations arising in interior-point methods for bound-constrained optimization, Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints, A Shifted Primal-Dual Penalty-Barrier Method for Nonlinear Optimization, A globally convergent primal-dual interior-point relaxation method for nonlinear programs, Reduced-basis techniques for rapid reliable optimization of systems described by affinely parametrized coercive elliptic partial differential equations, An infeasible interior-point arc-search algorithm for nonlinear constrained optimization, A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs, Delaunay-based derivative-free optimization via global surrogates. III: nonconvex constraints, 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 relaxation method with global and rapidly local convergence for nonlinear programs, Inertia-controlling factorizations for optimization algorithms, Primal-dual Newton-type interior-point method for topology optimization, An interior method for nonconvex semidefinite programs, A primal-dual interior point method for large-scale free material optimization, A globally and quadratically convergent primal–dual augmented Lagrangian algorithm for equality constrained optimization
Uses Software
