Theoretical justification of interior point algorithms for solving optimization problems with nonlinear constraints

DOI10.1134/S1995423913010035MaRDI QIDQ5407744zbMATH OpenOpenAlexFDO

Authors Sergeǐ Mihaǐlovich Perzhabinskiǐ, Valeriǐ Ivanovich Zorkaltsev

Publication date 7 April 2014

Published in Numerical Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s1995423913010035

zbMATH Keywords

interior point methodlinearizationweighted Euclidean rate

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Interior-point methods (90C51)

Recommendations

• scientific article; zbMATH DE number 269555
• A feasible interior-point algorithm for nonconvex nonlinear programming
• An interior-point algorithm for nonconvex nonlinear programming
• scientific article; zbMATH DE number 1551854
• Interior Point Methods for Nonlinear Optimization
• scientific article; zbMATH DE number 1097715
• On some efficient interior point methods for nonlinear convex programming
• The interior point method for nondifferentiable optimization
• An interior-point algorithm for nonlinear minimax problems
• Novel interior point algorithms for solving nonlinear convex optimization problems

Cited in

(1)

• Substantiation of interior point algorithms

This page was built for publication: Theoretical justification of interior point algorithms for solving optimization problems with nonlinear constraints

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