Feasible interior methods using slacks for nonlinear optimization

DOI10.1023/A:1025136421370zbMATH Open1053.90119OpenAlexW1495350211MaRDI QIDQ1410239FDOQ1410239

Authors: Richard A. Waltz, R. H. Byrd, Jorge Nocedal 

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

Recommendations

• Feasible direction interior-point technique for nonlinear optimization
• Convergent Infeasible Interior-Point Trust-Region Methods for Constrained Minimization
• A QP-free feasible method with slack NCP function
• Interior Methods for Nonlinear Optimization
• scientific article; zbMATH DE number 88933

zbMATH Keywords

nonlinear programmingsequential quadratic programmingconstrained optimizationinterior point methodtrust region methodlarge-scale optimizationprimal-dual methodfeasible methodbarrier method

Mathematics Subject Classification ID

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

Cited In (12)

• Convergent Infeasible Interior-Point Trust-Region Methods for Constrained Minimization
• Using interior point solvers for optimizing progressive lens models with spherical coordinates
• The resolution of the optimal reactive dispatch problem via the relaxed barrier-Lagrangian function method
• Evolutionary techniques applied to the optimal short-term scheduling of the electrical energy production
• Study of a primal-dual algorithm for equality constrained minimization
• Improving ultimate convergence of an augmented Lagrangian method
• Feasible methods for nonconvex nonsmooth problems with applications in green communications
• On second-order optimality conditions for nonlinear programming
• Interior-point solver for large-scale quadratic programming problems with bound constraints
• An effective pseudospectral method for constraint dynamic optimisation problems with characteristic times
• Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties
• A NOTE ON THE SQUARED SLACK VARIABLES TECHNIQUE FOR NONLINEAR OPTIMIZATION

Uses Software

• KNITRO
• CUTEr

This page was built for publication: Feasible interior methods using slacks for nonlinear optimization

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