Feasible interior methods using slacks for nonlinear optimization

DOI10.1023/A:1025136421370zbMath1053.90119OpenAlexW1495350211MaRDI QIDQ1410239

Richard A. Waltz, Byrd, Richard H., Nocedal, Jorge

Publication date: 14 October 2003

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1025136421370

zbMATH Keywords

barrier methodconstrained optimizationlarge-scale optimizationprimal-dual methodsequential quadratic programmingnonlinear programminginterior point methodtrust region methodfeasible method

Mathematics Subject Classification ID

Nonlinear programming (90C30) Interior-point methods (90C51) Methods of successive quadratic programming type (90C55)

Related Items

Feasible methods for nonconvex nonsmooth problems with applications in green communications, Interior-point solver for large-scale quadratic programming problems with bound constraints, An effective pseudospectral method for constraint dynamic optimisation problems with characteristic times, Using interior point solvers for optimizing progressive lens models with spherical coordinates, Improving ultimate convergence of an augmented Lagrangian method, Study of a primal-dual algorithm for equality constrained minimization, Evolutionary techniques applied to the optimal short-term scheduling of the electrical energy production, A resolução do problema de despacho ótimo de reativos pelo método da função lagrangiana-barreira relaxada, On second-order optimality conditions for nonlinear programming, Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties

Uses Software

• KNITRO
• CUTEr