Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problem
From MaRDI portal
Publication:4266399
DOI10.1016/S0362-546X(97)00516-6zbMath1060.90692OpenAlexW2051122184MaRDI QIDQ4266399
Bo Yu, Zhenghua Lin, Guo-Chen Feng
Publication date: 27 September 2000
Published in: Nonlinear Analysis: Theory, Methods & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0362-546x(97)00516-6
Related Items
AN ENTROPY CONTINUATION METHOD FOR A CLASS OF THE PERIODICITY PROBLEMS OF ORDINARY DIFFERENTIAL EQUATIONS, A CONSTRUCTIVE PROOF OF THE EXISTENCE OF THE PERIODIC SOLUTION OF THE PERIODICITY PROBLEMS OF ORDINARY DIFFERENTIAL EQUATIONS VIA A NON-INTERIOR POINT ENTROPY CONTINUATION METHOD, A NEW CONTINUATION METHOD FOR THE PERIODICITY PROBLEMS OF ORDINARY DIFFERENTIAL EQUATIONS, A homotopy method for getting a local minimum of constrained nonconvex programming, Global convergence analysis of the aggregate constraint homotopy method for nonlinear programming problems with both inequality and equality constraints, On the complexity of a combined homotopy interior method for convex programming, A modified homotopy method for solving the principal-agent bilevel programming problem, A combined homotopy interior point method for convex nonlinear programming, An aggregate deformation homotopy method for min-max-min problems with max-min constraints, A spline smoothing homotopy method for nonlinear programming problems with both inequality and equality constraints, Globally convergent homotopy method for designing piecewise linear deterministic contractual function, A smoothing homotopy method for variational inequality problems on polyhedral convex sets, The flattened aggregate constraint homotopy method for nonlinear programming problems with many nonlinear constraints, Strong convergence on the aggregate constraint-shifting homotopy method for solving general nonconvex programming, A comparison of normal cone conditions for homotopy methods for solving inequality constrained nonlinear programming problems, Homotopy method for solving variational inequalities with bounded box constraints, A constraint shifting homotopy method for general non-linear programming, Homotopy methods for solving variational inequalities in unbounded sets, Truncated aggregate homotopy method for nonconvex nonlinear programming, The aggregate constraint homotopy method for nonconvex nonlinear programming, Condition for global convergence of a homotopy method for variational inequality problems on unbounded sets, Solving nonconvex nonlinear programming problems via a new aggregate constraint homotopy method, A globally convergent interior point algorithm for non-convex nonlinear programming, Solving the Karush-Kuhn-Tucker system of a nonconvex programming problem on an unbounded set, A smoothing homotopy method for solving variational inequalities, Solving nonlinear programming problems via a homotopy continuation method under three unbounded conditions, A spline smoothing homotopy method for nonconvex nonlinear programming, Globally convergent method for designing twice spline contractual function, A new homotopy method for solving non-linear complementarity problems, A continuation method for solving fixed points of self-mappings in general nonconvex sets, Globally convergent homotopy algorithm for solving the KKT systems to the principal-agent bilevel programming, Solving nonlinear programming problems with unbounded non-convex constraint sets via a globally convergent algorithm
Cites Work
- Global ellipsoidal approximations and homotopy methods for solving convex analytic programs
- Interior path following primal-dual algorithms. I: Linear programming
- On some efficient interior point methods for nonlinear convex programming
- Interior-point methods for convex programming
- Global analysis and economics. VI: Geometric analysis of Pareto optima and price equilibria under classical hypotheses
- An implementation of Karmarkar's algorithm for linear programming
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- 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
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
