Strong convergence on the aggregate constraint-shifting homotopy method for solving general nonconvex programming
From MaRDI portal
Publication:2228205
DOI10.1155/2020/8887029zbMATH Open1489.90192OpenAlexW3113082483MaRDI QIDQ2228205FDOQ2228205
Authors: Zhichuan Zhu, Yeong-Cheng Liou 
Publication date: 16 February 2021
Published in: Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2020/8887029
Recommendations
- The aggregate constraint homotopy method for nonconvex nonlinear programming
- Solving nonconvex nonlinear programming problems via a new aggregate constraint homotopy method
- Convergence theorems of homotopy method for constrained nonconvex programming
- An aggregate homotopy interior-point method for a class of nonsmooth constrained optimization problems
- A constraint shifting homotopy method for general non-linear programming
- A constraint shifting homotopy method for computing fixed points on nonconvex sets
- Global convergence analysis of the aggregate constraint homotopy method for nonlinear programming problems with both inequality and equality constraints
- An aggregate homotopy interior-point method for general nonlinear programming problems
- Strong convergence for a general explicit convex combination method for nonexpansive mappings and equilibrium points
- scientific article; zbMATH DE number 4076972
Cites Work
- Title not available (Why is that?)
- A combined homotopy interior point method for convex nonlinear 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
- Strong convergence of a proximal point algorithm with general errors
- A convergent process of price adjustment and global Newton methods
- Title not available (Why is that?)
- Homotopy methods for solving variational inequalities in unbounded sets
- Hybrid viscosity extragradient method for systems of variational inequalities, fixed points of nonexpansive mappings, zero points of accretive operators in Banach spaces
- Homotopy method for a class of nonconvex Brouwer fixed-point problems
- Minimum-norm solution of variational inequality and fixed point problem in banach spaces
- Homotopy method for solving variational inequalities
- Title not available (Why is that?)
- The aggregate constraint homotopy method for nonconvex nonlinear programming
- A continuation method for solving fixed points of self-mappings in general nonconvex sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Viscosity approximation splitting methods for monotone and nonexpansive operators in Hilbert spaces
- Projection methods for firmly type nonexpansive operators
- Solving the Karush-Kuhn-Tucker system of a nonconvex programming problem on an unbounded set
- Iterative algorithms for generalized variational inequalities
- A combined homotopy infeasible interior point method for nonconvex programming
- Modified extragradient algorithms for solving monotone variational inequalities and fixed point problems
- A modified homotopy method for solving the principal-agent bilevel programming problem
- Boundary moving combined homotopy method for nonconvex nonlinear programming
- Boundary moving combined homotopy method for nonconvex nonlinear programming and its convergence
- Systems of variational inequalities with hierarchical variational inequality constraints for Lipschitzian pseudocontractions
- A proximal algorithm for solving split monotone variational inclusions
- Global convergence analysis of the aggregate constraint homotopy method for nonlinear programming problems with both inequality and equality constraints
Cited In (5)
- Solving nonconvex nonlinear programming problems via a new aggregate constraint homotopy method
- An aggregate homotopy interior-point method for general nonlinear programming problems
- The aggregate constraint homotopy method for nonconvex nonlinear programming
- A constraint shifting homotopy method for general non-linear programming
- Truncated aggregate homotopy method for nonconvex nonlinear programming
This page was built for publication: Strong convergence on the aggregate constraint-shifting homotopy method for solving general nonconvex programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2228205)
