An inexact proximal method for quasiconvex minimization
From MaRDI portal
Publication:319853
Recommendations
- Proximal quasi-Newton methods for nondifferentiable convex optimization
- Asymptotic convergence of an inertial proximal method for unconstrained quasiconvex minimization
- Inexact subgradient methods for quasi-convex optimization problems
- Inexact proximal point methods for quasiconvex minimization on Hadamard manifolds
- An inexact proximal method with proximal distances for quasimonotone equilibrium problems
- A proximal method for solving quasi-variational inequalities
- Relaxed-inertial proximal point type algorithms for quasiconvex minimization
- Practical inexact proximal quasi-Newton method with global complexity analysis
- Interior proximal methods for quasiconvex optimization
- An accelerated inexact proximal point algorithm for convex minimization
Cites work
- scientific article; zbMATH DE number 417962 (Why is no real title available?)
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 1369459 (Why is no real title available?)
- A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space
- A hybrid inexact logarithmic-quadratic proximal method for nonlinear complementarity problems
- A logarithmic-quadratic proximal method for variational inequalities
- A proximal method with separable Bregman distances for quasiconvex minimization over the nonnegative orthant
- A proximal point algorithm with a \(\varphi \)-divergence for quasiconvex programming
- A proximal point method for the variational inequality problem in Banach spaces
- A proximal-like algorithm for a class of nonconvex programming
- An extension of proximal methods for quasiconvex minimization on the nonnegative orthant
- An implementable proximal point algorithmic framework for nuclear norm minimization
- An inexact and nonmonotone proximal method for smooth unconstrained minimization
- An inexact hybrid generalized proximal point algorithm and some new results on the theory of Bregman functions
- Approximate iterations in Bregman-function-based proximal algorithms
- Clarke Subgradients of Stratifiable Functions
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming
- Generalized Gradients and Applications
- Hessian Riemannian Gradient Flows in Convex Programming
- Inexact proximal point algorithms and descent methods in optimization
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
- Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels
- Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints
- Interior proximal algorithm with variable metric for second-order cone programming: applications to structural optimization and support vector machines
- Interior proximal methods for quasiconvex optimization
- Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity
- Microeconomic theory
- Monotone Operators and the Proximal Point Algorithm
- On inexact generalized proximal methods with a weakened error tolerance criterion
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Proximal Minimization Methods with Generalized Bregman Functions
- Proximal point methods and nonconvex optimization
- Pseudomonotone operators and the Bregman proximal point algorithm
- Quasi-Concave Programming
- Quasiconvex optimization and location theory
- Regularized Lotka-Volterra dynamical system as continuous proximal-like method in optimization.
- Subdifferential properties of quasiconvex and pseudoconvex functions: Unified approach
- The gradient and heavy ball with friction dynamical systems: The quasiconvex case
- Variational Analysis
Cited in
(40)- An extension of the proximal point algorithm beyond convexity
- Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces
- Inexact proximal point methods for quasiconvex minimization on Hadamard manifolds
- Proximal linearization methods for Schatten \(p\)-quasi-norm minimization
- Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems
- Finite convergence and sharp minima for quasi-equilibrium problems
- Abstract generalized epsilon-descent algorithm
- A proximal point algorithm with a \(\varphi \)-divergence for quasiconvex programming
- On inexact versions of a quasi-equilibrium problem: a Cournot duopoly perspective
- An inexact algorithm with proximal distances for variational inequalities
- Linear and superlinear convergence of an inexact algorithm with proximal distances for variational inequality problems
- Inexact proximal point algorithm for multiobjective optimization
- Convergence rates of subgradient methods for quasi-convex optimization problems
- scientific article; zbMATH DE number 5197127 (Why is no real title available?)
- Semi-quasidifferentiability in nonsmooth nonconvex multiobjective optimization
- Relaxed-inertial proximal point type algorithms for quasiconvex minimization
- scientific article; zbMATH DE number 2202879 (Why is no real title available?)
- An extension of proximal methods for quasiconvex minimization on the nonnegative orthant
- On the convergence rate of an inexact proximal point algorithm for quasiconvex minimization on Hadamard manifolds
- Interior proximal methods for quasiconvex optimization
- Evaluation of fixed point quasiconvex subgradient method with computational inexactness
- 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
- An inexact proximal method with proximal distances for quasimonotone equilibrium problems
- scientific article; zbMATH DE number 1450268 (Why is no real title available?)
- On strongly quasiconvex functions: existence results and proximal point algorithms
- An improved proximal method with quasi-distance for nonconvex multiobjective optimization problem
- A linear scalarization proximal point method for quasiconvex multiobjective minimization
- An inexact proximal regularization method for unconstrained optimization
- Solving mixed variational inequalities beyond convexity
- An interior proximal method with proximal distances for quasimonotone equilibrium problems
- Coercivity and generalized proximal algorithms: application -- traveling around the world
- A proximal interior point algorithm with applications to image processing
- Two-step inertial forward-reflected-backward splitting based algorithm for nonconvex mixed variational inequalities
- Quasi-convex feasibility problems: subgradient methods and convergence rates
- Extension of forward-reflected-backward method to non-convex mixed variational inequalities
- A scalarization proximal point method for quasiconvex multiobjective minimization
- An inexact scalarization proximal point method for multiobjective quasiconvex minimization
- Calculating the proximal subdifferential via the quasidifferential
- Bregman proximal point type algorithms for quasiconvex minimization
This page was built for publication: An inexact proximal method for quasiconvex minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q319853)
