A penalized interior point approach for constrained nonlinear programming

DOI10.1007/S11741-009-0309-3MaRDI QIDQ3572651zbMATH OpenOpenAlexFDO

Authors Wen-Ting Lu, Yirong Yao, Liansheng 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

barrier penalty functionglobal convergence

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 5524381
• A penalty-interior-point algorithm for nonlinear constrained optimization
• An interior-point _1-penalty method for nonlinear optimization
• An Interior Point Method with a Primal-Dual Quadratic Barrier Penalty Function for Nonlinear Optimization
• An interior-point piecewise linear penalty method for nonlinear programming

Cites work

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

Cited in

(8)

• A penalty-interior-point algorithm for nonlinear constrained optimization
• Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties
• scientific article; zbMATH DE number 5524381 (Why is no real title available?)
• A two parameter mixed interior-exterior penalty algorithm
• A metaheuristic penalty approach for the starting point in nonlinear programming
• A projected-search interior-point method for nonlinearly constrained optimization
• An inner approximation method incorporating with a penalty function method for a reverse convex programming problem
• An interior-point \(\ell_{\frac{1}{2}}\)-penalty method for inequality constrained nonlinear optimization

Describes a project that uses

Uses Software

• TRICE

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

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