Convergent Infeasible Interior-Point Trust-Region Methods for Constrained Minimization
From MaRDI portal
Publication:4785889
DOI10.1137/S1052623499357945zbMath1049.90128MaRDI QIDQ4785889
Publication date: 5 January 2003
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
semidefinite programminginterior-point methodnonlinear programtrust-region strategylog-barrier functionfirst- and second-order stationary points
Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Interior-point methods (90C51)
Related Items (12)
A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms ⋮ A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties ⋮ Improving ultimate convergence of an augmented Lagrangian method ⋮ Evolutionary techniques applied to the optimal short-term scheduling of the electrical energy production ⋮ Penalized interior point approach for constrained nonlinear programming ⋮ On second-order optimality conditions for nonlinear programming ⋮ Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties ⋮ A primal-dual interior point method for nonlinear semidefinite programming ⋮ A globally convergent primal-dual interior-point relaxation method for nonlinear programs ⋮ A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs ⋮ Global convergence analysis of line search interior-point methods for nonlinear programming without regularity assumptions ⋮ Mathematical programs with equilibrium constraints: a sequential optimality condition, new constraint qualifications and algorithmic consequences
Uses Software
This page was built for publication: Convergent Infeasible Interior-Point Trust-Region Methods for Constrained Minimization
