An inexact proximal method for quasiconvex minimization
From MaRDI portal
Publication:319853
DOI10.1016/J.EJOR.2015.05.041zbMATH Open1346.90689OpenAlexW1959749429MaRDI QIDQ319853FDOQ319853
P. R. Oliveira, L. Mallma Ramirez, E. A. Papa Quiroz
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) Nonsmooth analysis (49J52) Derivative-free methods and methods using generalized derivatives (90C56)
Cites Work
- Title not available (Why is that?)
- Variational Analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Clarke Subgradients of Stratifiable Functions
- Monotone Operators and the Proximal Point Algorithm
- An implementable proximal point algorithmic framework for nuclear norm minimization
- Proximal Minimization Methods with Generalized Bregman Functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximate iterations in Bregman-function-based proximal algorithms
- A logarithmic-quadratic proximal method for variational inequalities
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- A hybrid inexact logarithmic-quadratic proximal method for nonlinear complementarity problems
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Quasi-Concave Programming
- Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels
- A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space
- Proximal point methods and nonconvex optimization
- Generalized Gradients and Applications
- Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity
- Regularized Lotka-Volterra dynamical system as continuous proximal-like method in optimization.
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- 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
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
- A proximal method with separable Bregman distances for quasiconvex minimization over the nonnegative orthant
- Subdifferential properties of quasiconvex and pseudoconvex functions: Unified approach
- Quasiconvex optimization and location theory
- Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints
- Pseudomonotone operators and the Bregman proximal point algorithm
- An inexact and nonmonotone proximal method for smooth unconstrained minimization
- Inexact proximal point algorithms and descent methods in optimization
- A proximal point algorithm with a Ο-divergence for quasiconvex programming
- Interior proximal algorithm with variable metric for second-order cone programming: applications to structural optimization and support vector machines
- A proximal-like algorithm for a class of nonconvex programming
- An extension of proximal methods for quasiconvex minimization on the nonnegative orthant
- Interior proximal methods for quasiconvex optimization
- Hessian Riemannian Gradient Flows in Convex Programming
- On inexact generalized proximal methods with a weakened error tolerance criterion
- Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming
- The gradient and heavy ball with friction dynamical systems: The quasiconvex case
Cited In (34)
- An improved proximal method with quasi-distance for nonconvex multiobjective optimization problem
- Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems
- A linear scalarization proximal point method for quasiconvex multiobjective minimization
- Quasi-convex feasibility problems: subgradient methods and convergence rates
- Solving mixed variational inequalities beyond convexity
- Calculating the proximal subdifferential via the quasidifferential
- An inexact algorithm with proximal distances for variational inequalities
- Title not available (Why is that?)
- Proximal linearization methods for Schatten \(p\)-quasi-norm minimization
- Title not available (Why is that?)
- 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
- A proximal interior point algorithm with applications to image processing
- Bregman proximal point type algorithms for quasiconvex minimization
- Title not available (Why is that?)
- An interior proximal method with proximal distances for quasimonotone equilibrium problems
- On the convergence rate of an inexact proximal point algorithm for quasiconvex minimization on Hadamard manifolds
- A scalarization proximal point method for quasiconvex multiobjective minimization
- An inexact proximal method with proximal distances for quasimonotone equilibrium problems
- Coercivity and generalized proximal algorithms: application -- traveling around the world
- 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
- An inexact scalarization proximal point method for multiobjective quasiconvex minimization
- Finite convergence and sharp minima for quasi-equilibrium problems
- Abstract generalized epsilon-descent algorithm
- On inexact versions of a quasi-equilibrium problem: a Cournot duopoly perspective
- Convergence rates of subgradient methods for quasi-convex optimization problems
- Title not available (Why is that?)
- Semi-quasidifferentiability in nonsmooth nonconvex multiobjective optimization
- On strongly quasiconvex functions: existence results and proximal point algorithms
- Inexact proximal point methods for quasiconvex minimization on Hadamard manifolds
- Title not available (Why is that?)
- Relaxed-inertial proximal point type algorithms for quasiconvex minimization
- An inexact proximal regularization method for unconstrained optimization
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 π π
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)
