Global convergence analysis of the aggregate constraint homotopy method for nonlinear programming problems with both inequality and equality constraints
From MaRDI portal
Publication:3177632
DOI10.1080/02331934.2018.1470174zbMath1402.90182OpenAlexW2804494076WikidataQ129795095 ScholiaQ129795095MaRDI QIDQ3177632
Menglong Su, Zhengyong Zhou, Yu-Feng Shang, Feng Hui Wang
Publication date: 1 August 2018
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2018.1470174
Related Items (3)
A spline smoothing homotopy method for nonlinear programming problems with both inequality and equality constraints ⋮ Unnamed Item ⋮ Strong convergence on the aggregate constraint-shifting homotopy method for solving general nonconvex programming
Cites Work
- Unnamed Item
- Unnamed Item
- A homotopy method for nonlinear semidefinite programming
- Algorithms with adaptive smoothing for finite minimax problems
- An aggregate deformation homotopy method for min-max-min problems with max-min constraints
- A boundary perturbation interior point homotopy method for solving fixed point problems
- A new polynomial-time algorithm for linear programming
- A truncated aggregate smoothing Newton method for minimax problems
- Solving nonconvex nonlinear programming problems via a new aggregate constraint homotopy method
- A polynomial-time algorithm, based on Newton's method, for linear programming
- Interior path following primal-dual algorithms. I: Linear programming
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- Test examples for nonlinear programming codes
- 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
- 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
- A modified homotopy method for solving the principal-agent bilevel programming problem
- Zero duality gap in surrogate constraint optimization: a concise review of models
- A predictor-corrector algorithm combined conjugate gradient with homotopy interior point for general nonlinear programming
- Globally convergent homotopy method for designing piecewise linear deterministic contractual function
- A smoothing homotopy method for variational inequality problems on polyhedral convex sets
- A smoothing homotopy method for solving variational inequalities
- 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
- On Steplength Algorithms for a Class of Continuation Methods
- An Aggregate Constraint Method for Non-Linear Programming
- A path following algorithm for a class of convex programming problems
- Path-Following Methods for Linear Programming
- 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 constraint shifting homotopy method for general non-linear programming
- Globally convergent homotopy algorithm for solving the KKT systems to the principal-agent bilevel programming
- A Derivative-Free Algorithm for Linearly Constrained Finite Minimax Problems
- Truncated aggregate homotopy method for nonconvex nonlinear programming
- The aggregate constraint homotopy method for nonconvex nonlinear programming
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
