Interior proximal methods for quasiconvex optimization
From MaRDI portal
(Redirected from Publication:427358)
Recommendations
- 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 \(\varphi \)-divergence for quasiconvex programming
Cites work
- scientific article; zbMATH DE number 587626 (Why is no real title available?)
- scientific article; zbMATH DE number 3296905 (Why is no real title available?)
- A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space
- A generalized proximal point algorithm for certain non-convex minimization problems
- 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
- 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
Cited in
(25)- Relaxed-inertial proximal point type algorithms for quasiconvex minimization
- Buffered Probability of Exceedance: Mathematical Properties and Optimization
- Solving mixed variational inequalities beyond convexity
- Variance reduced forward-reflected-backward algorithm for solving nonconvex finite-sum mixed variational inequalities
- An interior proximal gradient method for nonconvex optimization
- An inexact algorithm with proximal distances for variational inequalities
- Linear and superlinear convergence of an inexact algorithm with proximal distances for variational inequality problems
- Strongly convex set-valued maps
- An interior proximal method for a class of quasimonotone variational inequalities
- An extension of the proximal point algorithm beyond convexity
- Convergence of inexact quasisubgradient methods with extrapolation
- An inexact proximal method for quasiconvex minimization
- An extension of proximal methods for quasiconvex minimization on the nonnegative orthant
- Bregman proximal point type algorithms for quasiconvex minimization
- 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
- A scalarization proximal point method for quasiconvex multiobjective minimization
- An inexact proximal method with proximal distances for quasimonotone equilibrium problems
- An inexact scalarization proximal point method for multiobjective quasiconvex minimization
- Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints
- A proximal point algorithm with a \(\varphi \)-divergence for quasiconvex programming
- 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
- Logarithmic quasi-distance proximal point scalarization method for multi-objective programming
- On strongly quasiconvex functions: existence results and proximal point algorithms
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)
