Global convergence analysis of the aggregate constraint homotopy method for nonlinear programming problems with both inequality and equality constraints

Cites Work

A Derivative-Free Algorithm for Linearly Constrained Finite Minimax Problems
A new polynomial-time algorithm for linear programming
A polynomial-time algorithm, based on Newton's method, for linear 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
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
Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problem
Introduction to Numerical Continuation Methods
Test examples for nonlinear programming codes
Algorithms with adaptive smoothing for finite minimax problems
Interior path following primal-dual algorithms. II: Convex quadratic programming
Interior path following primal-dual algorithms. I: Linear programming
Path-Following Methods for Linear Programming
A homotopy method for nonlinear semidefinite programming
An Aggregate Constraint Method for Non-Linear Programming
On the entropic regularization method for solving min-max problems with applications
Failure of global convergence for a class of interior point methods for nonlinear programming
Title not available (Why is that?)
An aggregate deformation homotopy method for min-max-min problems with max-min constraints
A truncated aggregate smoothing Newton method for minimax problems
On Steplength Algorithms for a Class of Continuation Methods
The aggregate constraint homotopy method for nonconvex nonlinear programming
A boundary perturbation interior point homotopy method for solving fixed point problems
A smoothing homotopy method for solving variational inequalities
A constraint shifting homotopy method for general non-linear programming
Solving nonconvex nonlinear programming problems via a new aggregate constraint homotopy method
Title not available (Why is that?)
A modified homotopy method for solving the principal-agent bilevel programming problem
Zero duality gap in surrogate constraint optimization: a concise review of models
Globally convergent homotopy method for designing piecewise linear deterministic contractual function
A smoothing homotopy method for variational inequality problems on polyhedral convex sets
Truncated aggregate homotopy method for nonconvex nonlinear programming
Globally convergent homotopy algorithm for solving the KKT systems to the principal-agent bilevel programming
A predictor-corrector algorithm combined conjugate gradient with homotopy interior point for general nonlinear programming

Cited In (3)

Strong convergence on the aggregate constraint-shifting homotopy method for solving general nonconvex programming
Title not available (Why is that?)
A spline smoothing homotopy method for nonlinear programming problems with both inequality and equality constraints

This page was built for publication: Global convergence analysis of the aggregate constraint homotopy method for nonlinear programming problems with both inequality and equality constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3177632)