An inexact proximal method for quasiconvex minimization
From MaRDI portal
Publication:319853
DOI10.1016/j.ejor.2015.05.041zbMath1346.90689OpenAlexW1959749429MaRDI QIDQ319853
Publication date: 6 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2015.05.041
global optimizationnonlinear programmingcomputing scienceproximal point methodsquasiconvex minimization
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56) Nonsmooth analysis (49J52)
Related Items
Inexact proximal point methods for quasiconvex minimization on Hadamard manifolds, Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems, Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces, An inexact algorithm with proximal distances for variational inequalities, An inexact scalarization proximal point method for multiobjective quasiconvex minimization, On the convergence rate of an inexact proximal point algorithm for quasiconvex minimization on Hadamard manifolds, An inexact proximal method with proximal distances for quasimonotone equilibrium 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, A scalarization proximal point method for quasiconvex multiobjective minimization, A proximal interior point algorithm with applications to image processing, Unnamed Item, A linear scalarization proximal point method for quasiconvex multiobjective minimization, Solving mixed variational inequalities beyond convexity, Unnamed Item, Quasi-convex feasibility problems: subgradient methods and convergence rates, Semi-quasidifferentiability in nonsmooth nonconvex multiobjective optimization, Convergence rates of subgradient methods for quasi-convex optimization problems, An improved proximal method with quasi-distance for nonconvex multiobjective optimization problem, An extension of the proximal point algorithm beyond convexity, On strongly quasiconvex functions: existence results and proximal point algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An extension of proximal methods for quasiconvex minimization on the nonnegative orthant
- Interior proximal methods for quasiconvex optimization
- An implementable proximal point algorithmic framework for nuclear norm minimization
- Regularized Lotka-Volterra dynamical system as continuous proximal-like method in optimization.
- Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- The gradient and heavy ball with friction dynamical systems: The quasiconvex case
- A proximal method with separable Bregman distances for quasiconvex minimization over the nonnegative orthant
- Subdifferential properties of quasiconvex and pseudoconvex functions: Unified approach
- Proximal point methods and nonconvex optimization
- Approximate iterations in Bregman-function-based proximal algorithms
- A logarithmic-quadratic proximal method for variational inequalities
- Quasiconvex optimization and location theory
- Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Pseudomonotone operators and the Bregman proximal point algorithm
- An inexact and nonmonotone proximal method for smooth unconstrained minimization
- A hybrid inexact logarithmic-quadratic proximal method for nonlinear complementarity problems
- Inexact proximal point algorithms and descent methods in optimization
- A Proximal Point Method for the Variational Inequality Problem in Banach Spaces
- An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions
- A proximal point algorithm with a ϕ-divergence for quasiconvex programming
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Interior proximal algorithm with variable metric for second-order cone programming: applications to structural optimization and support vector machines
- Quasi-Concave Programming
- Clarke Subgradients of Stratifiable Functions
- Generalized Gradients and Applications
- Monotone Operators and the Proximal Point Algorithm
- Variational Analysis
- Proximal Minimization Methods with Generalized Bregman Functions
- A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space
- Hessian Riemannian Gradient Flows in Convex Programming
- On inexact generalized proximal methods with a weakened error tolerance criterion
- Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
- Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity
