Strong convergence on the aggregate constraint-shifting homotopy method for solving general nonconvex programming

DOI10.1155/2020/8887029MaRDI QIDQ2228205zbMATH OpenOpenAlexFDO

Authors Zhichuan Zhu, Yeong-Cheng Liou

Publication date 16 February 2021

Published in Journal of Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2020/8887029

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Review text

Summary: In the paper, the aggregate constraint-shifting homotopy method for solving general nonconvex nonlinear programming is considered. The aggregation is only about inequality constraint functions. Without any cone condition for the constraint functions, the existence and convergence of the globally convergent solution to the K-K-T system are obtained for both feasible and infeasible starting points under much weaker conditions.

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

• A combined homotopy infeasible interior point method for nonconvex programming
• A combined homotopy interior point method for convex nonlinear programming
• A Constructive Proof of the Brouwer Fixed-Point Theorem and Computational Results
• A continuation method for solving fixed points of self-mappings in general nonconvex sets
• A convergent process of price adjustment and global Newton methods
• A modified homotopy method for solving the principal-agent bilevel programming problem
• A proximal algorithm for solving split monotone variational inclusions
• Boundary moving combined homotopy method for nonconvex nonlinear programming
• Boundary moving combined homotopy method for nonconvex nonlinear programming and its convergence
• Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problem
• Finding Zeroes of Maps: Homotopy Methods That are Constructive With Probability One
• Global convergence analysis of the aggregate constraint homotopy method for nonlinear programming problems with both inequality and equality constraints
• Homotopy method for a class of nonconvex Brouwer fixed-point problems
• Homotopy method for solving variational inequalities
• Homotopy methods for solving variational inequalities in unbounded sets
• scientific article; zbMATH DE number 3682672 (Why is no real title available?)
• scientific article; zbMATH DE number 6847097 (Why is no real title available?)
• scientific article; zbMATH DE number 2164053 (Why is no real title available?)
• scientific article; zbMATH DE number 7598100 (Why is no real title available?)
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• Hybrid viscosity extragradient method for systems of variational inequalities, fixed points of nonexpansive mappings, zero points of accretive operators in Banach spaces
• Introduction to Numerical Continuation Methods
• Iterative algorithms for generalized variational inequalities
• Minimum-norm solution of variational inequality and fixed point problem in banach spaces
• Modified extragradient algorithms for solving monotone variational inequalities and fixed point problems
• Projection methods for firmly type nonexpansive operators
• Solving the Karush-Kuhn-Tucker system of a nonconvex programming problem on an unbounded set
• Strong convergence of a proximal point algorithm with general errors
• Systems of variational inequalities with hierarchical variational inequality constraints for Lipschitzian pseudocontractions
• The aggregate constraint homotopy method for nonconvex nonlinear programming
• Viscosity approximation splitting methods for monotone and nonexpansive operators in Hilbert spaces

Cited in

(6)

• An aggregate homotopy interior-point method for general nonlinear programming problems
• A constraint shifting homotopy method for finding a minimal efficient solution of nonconvex multiobjective programming
• A constraint shifting homotopy method for general non-linear programming
• Truncated aggregate homotopy method for nonconvex nonlinear programming
• The aggregate constraint homotopy method for nonconvex nonlinear programming
• Solving nonconvex nonlinear programming problems via a new aggregate constraint homotopy method

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)