Penalized interior point approach for constrained nonlinear programming

DOI10.1007/s11741-009-0309-3zbMath1212.90354OpenAlexW1990909561MaRDI QIDQ3572651

Wen-Ting Lu, Yi-rong Yao, Lian-Sheng Zhang

Publication date: 8 July 2010

Published in: Journal of Shanghai University (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11741-009-0309-3

zbMATH Keywords

global convergencebarrier penalty function

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interior-point methods (90C51)

Uses Software

• TRICE

Cites Work

• A new self-dual embedding method for convex programming
• On the global convergence of a modified augmented Lagrangian linesearch interior-point Newton method for nonlinear programming
• A robust trust region method for general constrained optimization
• On implementing a primal-dual interior-point method for conic quadratic optimization
• A primal-dual trust-region algorithm for non-convex nonlinear programming
• A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization
• A simple primal-dual feasible interior-point method for nonlinear programming with monotone descent
• Local convergence of a primal-dual method for degenerate nonlinear programming
• On the formulation and theory of the Newton interior-point method for nonlinear programming
• 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
• Superlinear Convergence of Primal-Dual Interior Point Algorithms for Nonlinear Programming
• Primal-dual interior-point algorithms with dynamic step-size based on kernel functions for linear programming
• A class of polynomial primal-dual interior-point algorithms for semidefinite optimization
• Trust-Region Interior-Point SQP Algorithms for a Class of Nonlinear Programming Problems
• A Robust Primal-Dual Interior-Point Algorithm for Nonlinear Programs
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• A general class of penalty/barrier path-following Newton methods for nonlinear programming
• Convergent Infeasible Interior-Point Trust-Region Methods for Constrained Minimization
• Interior Methods for Nonlinear Optimization

This page was built for publication: Penalized interior point approach for constrained nonlinear programming