The flattened aggregate constraint homotopy method for nonlinear programming problems with many nonlinear constraints

DOI10.1155/2014/430932zbMath1470.90136OpenAlexW1981948365WikidataQ59038076 ScholiaQ59038076MaRDI QIDQ1724113

Zhengyong Zhou, Bo Yu

Publication date: 14 February 2019

Published in: Abstract and Applied Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/430932

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Interior-point methods (90C51)

Related Items (1)

Flattened aggregate function method for nonlinear programming with many complicated constraints

Uses Software

• Unnamed Item
• Unnamed Item
• Unnamed Item
• CUTEr
• SifDec

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An aggregate function method for nonlinear programming
• An interior-point algorithm for nonconvex nonlinear programming
• Interior point methods of mathematical programming
• A smoothing Newton method for semi-infinite programming
• Theory of Globally Convergent Probability-One Homotopies for Nonlinear Programming
• Lectures on Modern Convex Optimization
• Primal-Dual Interior Methods for Nonconvex Nonlinear Programming
• Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problem
• Introduction to Numerical Continuation Methods
• An Interior Point Algorithm for Large-Scale Nonlinear Programming
• SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
• CUTEr and SifDec
• The aggregate constraint homotopy method for nonconvex nonlinear programming
• Nonlinear programming without a penalty function.

This page was built for publication: The flattened aggregate constraint homotopy method for nonlinear programming problems with many nonlinear constraints