Solving the Karush-Kuhn-Tucker system of a nonconvex programming problem on an unbounded set
DOI10.1016/j.na.2008.01.008zbMath1171.65049OpenAlexW2074491242MaRDI QIDQ2518117
Publication date: 13 January 2009
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.2008.01.008
global convergenceunbounded setnumerical examplesnonconvex programminghomotopy methodnonlinear programminginterior point methodKarush-Kuhn-Tucker system
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10) Interior-point methods (90C51) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20)
Related Items (4)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decomposition methods for solving nonconvex quadratic programs via branch and bound
- Test examples for nonlinear programming codes
- A combined homotopy interior point method for general nonlinear programming problems
- A combined homotopy interior point method for convex nonlinear programming
- Interior-point methods for nonconvex nonlinear programming: jamming and numerical testing
- A feasible interior-point algorithm for nonconvex nonlinear programming
- Solutions and optimality criteria to box constrained nonconvex minimization problems
- Robust solution of nonconvex global optimization problems
- Theory of Globally Convergent Probability-One Homotopies for Nonlinear Programming
- Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problem
This page was built for publication: Solving the Karush-Kuhn-Tucker system of a nonconvex programming problem on an unbounded set