Solving nonlinear programming problems with unbounded non-convex constraint sets via a globally convergent algorithm

DOI10.1186/1029-242X-2014-281zbMath1343.90092WikidataQ59323330 ScholiaQ59323330MaRDI QIDQ257838

Menglong Su, Zhonghai Xu, Jian Hua Li

Publication date: 17 March 2016

Published in: Journal of Inequalities and Applications (Search for Journal in Brave)

zbMATH Keywords

non-convex setsnonlinear programming problemsunbounded conditions

Mathematics Subject Classification ID

Nonlinear programming (90C30) Interior-point methods (90C51)

Cites Work

• On the complexity of a combined homotopy interior method for convex programming
• On some efficient interior point methods for nonlinear convex programming
• Global analysis and economics. VI: Geometric analysis of Pareto optima and price equilibria under classical hypotheses
• A combined homotopy interior point method for convex nonlinear programming
• An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence
• The Projective SUMT Method for Convex Programming
• An Approach to Homotopy and Degree Theory
• A path following algorithm for a class of convex programming problems
• A Constructive Proof of the Brouwer Fixed-Point Theorem and Computational Results
• 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
• Introduction to Numerical Continuation Methods
• A Constructive Proof of the Poincare-Birkhoff Theorem
• Condition for global convergence of a homotopy method for variational inequality problems on unbounded sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item