Global convergence analysis of the aggregate constraint homotopy method for nonlinear programming problems with both inequality and equality constraints
From MaRDI portal
Publication:3177632
Recommendations
- The aggregate constraint homotopy method for nonconvex nonlinear programming
- Truncated aggregate homotopy method for nonconvex nonlinear programming
- An aggregate homotopy interior-point method for general nonlinear programming problems
- Solving nonconvex nonlinear programming problems via a new aggregate constraint homotopy method
- The flattened aggregate constraint homotopy method for nonlinear programming problems with many nonlinear constraints
Cites work
- scientific article; zbMATH DE number 2032319 (Why is no real title available?)
- A Constructive Proof of the Brouwer Fixed-Point Theorem and Computational Results
- A Derivative-Free Algorithm for Linearly Constrained Finite Minimax Problems
- A boundary perturbation interior point homotopy method for solving fixed point problems
- A combined homotopy infeasible interior point method for nonconvex programming
- A constraint shifting homotopy method for general non-linear programming
- A homotopy method for nonlinear semidefinite programming
- A modified homotopy method for solving the principal-agent bilevel programming problem
- A new polynomial-time algorithm for linear programming
- A path following algorithm for a class of convex programming problems
- A polynomial-time algorithm, based on Newton's method, for linear programming
- A predictor-corrector algorithm combined conjugate gradient with homotopy interior point for general nonlinear programming
- A smoothing homotopy method for solving variational inequalities
- A smoothing homotopy method for variational inequality problems on polyhedral convex sets
- A truncated aggregate smoothing Newton method for minimax problems
- Algorithms with adaptive smoothing for finite minimax problems
- An Aggregate Constraint Method for Non-Linear Programming
- An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence
- An aggregate deformation homotopy method for min-max-min problems with max-min constraints
- Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problem
- Failure of global convergence for a class of interior point methods for nonlinear programming
- Finding Zeroes of Maps: Homotopy Methods That are Constructive With Probability One
- Global analysis and economics. VI: Geometric analysis of Pareto optima and price equilibria under classical hypotheses
- Globally convergent homotopy algorithm for solving the KKT systems to the principal-agent bilevel programming
- Globally convergent homotopy method for designing piecewise linear deterministic contractual function
- Interior path following primal-dual algorithms. I: Linear programming
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- Introduction to Numerical Continuation Methods
- On Steplength Algorithms for a Class of Continuation Methods
- On some efficient interior point methods for nonlinear convex programming
- On the entropic regularization method for solving min-max problems with applications
- Path-Following Methods for Linear Programming
- Solving nonconvex nonlinear programming problems via a new aggregate constraint homotopy method
- Test examples for nonlinear programming codes
- The Projective SUMT Method for Convex Programming
- The aggregate constraint homotopy method for nonconvex nonlinear programming
- Truncated aggregate homotopy method for nonconvex nonlinear programming
- Zero duality gap in surrogate constraint optimization: a concise review of models
Cited in
(3)- Strong convergence on the aggregate constraint-shifting homotopy method for solving general nonconvex programming
- A spline smoothing homotopy method for nonlinear programming problems with both inequality and equality constraints
- Dynamic constraint homotopy algorithm for solving a class of extremum problem of function
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)
