A primal-dual trust-region algorithm for non-convex nonlinear programming
From MaRDI portal
Publication:1591480
DOI10.1007/s101070000144zbMath0970.90116MaRDI QIDQ1591480
Dominique Orban, Nicholas I. M. Gould, Andrew R. Conn, Phillipe L. Toint
Publication date: 10 September 2001
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Related Items
On the componentwise boundedness away from zero of iterates generated by stabilized interior point methods ⋮ Feasible methods for nonconvex nonsmooth problems with applications in green communications ⋮ On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods ⋮ Second-order negative-curvature methods for box-constrained and general constrained optimization ⋮ A globally convergent regularized interior point method for constrained optimization ⋮ An Interior-Point $$\boldsymbol{\ell_{1}}$$ -Penalty Method for Nonlinear Optimization ⋮ The interior-point revolution in optimization: History, recent developments, and lasting consequences ⋮ Complexity analysis of interior-point methods for second-order stationary points of nonlinear semidefinite optimization problems ⋮ An interior point method for nonlinear optimization with a quasi-tangential subproblem ⋮ An interior-point \(\ell_{\frac{1}{2}}\)-penalty method for inequality constrained nonlinear optimization ⋮ Filling holes under non-linear constraints ⋮ Structure-Exploiting Interior Point Methods ⋮ An adaptively regularized sequential quadratic programming method for equality constrained optimization ⋮ Penalized interior point approach for constrained nonlinear programming ⋮ On the solution of NP-hard linear complementarity problems ⋮ On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming ⋮ Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties ⋮ QPLIB: a library of quadratic programming instances ⋮ An iterative working-set method for large-scale nonconvex quadratic programming
