Interior proximal methods for quasiconvex optimization
A generalized proximal point algorithm (PPA) for the minimization of a nonconvex function on a feasible set is investigated. It is interesting to know if methods also converge under essentially weaker assumptions. The present paper deals with the convergence analysis of both PPA and its extension, to optimization problems with only quasiconvex objectives. This includes several results on well-definedness; that is, solvability of the subproblems as well as their uniqueness and existence of solutions in int\((K)\) for the zone coercive case. The authors illustrate that in some sense quasi-convexity is the weakest assumption that permits to obtain results presented in this paper. Apart from numerical advantage for nonconvex problems, the fact that well-definedness and convergence can principally be obtained under weaker conditions than those in literature seems to be interesting, see also [\textit{M. Fukushima} and \textit{H. Mine}, Int. J. Syst. Sci. 12, 989--1000 (1981; Zbl 0467.65028)] and [\textit{A. Kaplan} and \textit{R. Tichatschke}, J. Glob. Optim. 13, No. 4, 389--406 (1998; Zbl 0916.90224)].
- An extension of proximal methods for quasiconvex minimization on the nonnegative orthant
- An inexact proximal method for quasiconvex minimization
- Relaxed-inertial proximal point type algorithms for quasiconvex minimization
- Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints
- A proximal point algorithm with a -divergence for quasiconvex programming
- A generalized proximal point algorithm for certain non-convex minimization problems
- A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space
- An interior point method with Bregman functions for the variational inequality problem with paramonotone operators
- An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Convergence analysis of an extended auxiliary problem principle with various stopping criteria
- Forcing strong convergence of proximal point iterations in a Hilbert space
- scientific article; zbMATH DE number 587626 (Why is no real title available?)
- scientific article; zbMATH DE number 3296905 (Why is no real title available?)
- Monotone Operators and the Proximal Point Algorithm
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Note on the paper: Interior proximal method for variational inequalities on non-polyhedral sets
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- On the cutting plane property and the Bregman proximal point algorithm
- Optimization and nonsmooth analysis
- Proximal minimization algorithm with \(D\)-functions
- Proximal point method and elliptic regularization
- Proximal point methods and nonconvex optimization
- Pseudomonotone operators and the Bregman proximal point algorithm
- Self-adaptive inexact proximal point methods
- A proximal method with separable Bregman distances for quasiconvex minimization over the nonnegative orthant
- Asymptotic convergence of an inertial proximal method for unconstrained quasiconvex minimization
- Proximal point methods and nonconvex optimization
- An inexact proximal method with proximal distances for quasimonotone equilibrium problems
- Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints
- An interior proximal method for a class of quasimonotone variational inequalities
- Solving mixed variational inequalities beyond convexity
- An extension of the proximal point algorithm beyond convexity
- On strongly quasiconvex functions: existence results and proximal point algorithms
- Convergence of inexact quasisubgradient methods with extrapolation
- Strongly convex set-valued maps
- An inexact scalarization proximal point method for multiobjective quasiconvex minimization
- Relaxed-inertial proximal point type algorithms for quasiconvex minimization
- A proximal point algorithm with a -divergence for quasiconvex programming
- An inexact proximal method for quasiconvex minimization
- An extension of proximal methods for quasiconvex minimization on the nonnegative orthant
- An inexact algorithm with proximal distances for variational inequalities
- Buffered Probability of Exceedance: Mathematical Properties and Optimization
- Linear and superlinear convergence of an inexact algorithm with proximal distances for variational inequality problems
- Two-step inertial forward-reflected-backward splitting based algorithm for nonconvex mixed variational inequalities
- Extension of forward-reflected-backward method to non-convex mixed variational inequalities
- Bregman proximal point type algorithms for quasiconvex minimization
- Variance reduced forward-reflected-backward algorithm for solving nonconvex finite-sum mixed variational inequalities
- An interior proximal gradient method for nonconvex optimization
- Logarithmic quasi-distance proximal point scalarization method for multi-objective programming
- A Bregman proximal point algorithm without convexity in Banach spaces
- Decomposed quasiconvex optimization with application to generalized cone problems
- A proximal algorithm for constrained multiobjective minimization with quasiconvex functions
- A scalarization proximal point method for quasiconvex multiobjective minimization
This page was built for publication: Interior proximal methods for quasiconvex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q427358)
