Solving nonconvex nonlinear programming problems via a new aggregate constraint homotopy method

DOI10.1016/j.na.2010.06.032zbMath1210.65119MaRDI QIDQ988146

Bo Yu, Menglong Su, Jian Wang

Publication date: 26 August 2010

Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.na.2010.06.032

zbMATH Keywords

numerical examples; nonlinear programming; computational efficiency; Karush-Kuhn-Tucker conditions; predictor-corrector algorithms; aggregate constraint homotopy method; Euler-Newton procedure

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C06: Large-scale problems in mathematical programming

90C26: Nonconvex programming, global optimization

90C30: Nonlinear programming

65Y20: Complexity and performance of numerical algorithms

Related Items

Zero duality gap in surrogate constraint optimization: a concise review of models

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nondifferential optimization via adaptive smoothing
• An Aggregate Constraint Method for Non-Linear Programming
• Finding Zeroes of Maps: Homotopy Methods That are Constructive With Probability One
• Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problem
• The aggregate constraint homotopy method for nonconvex nonlinear programming