Convergence of inexact quasisubgradient methods with extrapolation
From MaRDI portal
Publication:2139278
DOI10.1007/s10957-022-02014-1zbMath1495.65085OpenAlexW4214940602MaRDI QIDQ2139278
Publication date: 17 May 2022
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-022-02014-1
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Numerical methods based on nonlinear programming (49M37)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Smooth minimization of non-smooth functions
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Inertial Douglas-Rachford splitting for monotone inclusion problems
- Interior proximal methods for quasiconvex optimization
- Convergence of the projected gradient method for quasiconvex multiobjective optimization
- Handbook of generalized convexity and generalized monotonicity
- Convergence rates of subgradient methods for quasi-convex optimization problems
- Lower subdifferentiable functions and their minimization by cutting planes
- Asymptotic convergence of an inertial proximal method for unconstrained quasiconvex minimization
- Generalized concavity
- Generalized convexity, generalized monotonicity: recent results. Proceedings of the 5th symposium, Luminy, France, June 17--21, 1996
- Quasiconvex optimization and location theory
- Introductory lectures on convex optimization. A basic course.
- Aggregation functions and generalized convexity in fuzzy optimization and decision making
- Estimates of the labor cost of combined relaxation methods
- A first-order primal-dual algorithm for convex problems with applications to imaging
- On properties of supporting and quasi-supporting vectors
- The effect of deterministic noise in subgradient methods
- Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions
- An inexact proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth optimization problems
- Relative-error inertial-relaxed inexact versions of Douglas-Rachford and ADMM splitting algorithms
- General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems
- Constrained optimization and image space analysis. Vol. 1: Separation of sets and optimality conditions
- Inexact subgradient methods for quasi-convex optimization problems
- An Appropriate Subdifferential for Quasiconvex Functions
- iPiano: Inertial Proximal Algorithm for Nonconvex Optimization
- Linear Convergence of Proximal Gradient Algorithm with Extrapolation for a Class of Nonconvex Nonsmooth Minimization Problems
- Portfolio Optimization Under a Minimax Rule
- Weak Sharp Minima in Mathematical Programming
- Inertial Proximal Alternating Linearized Minimization (iPALM) for Nonconvex and Nonsmooth Problems
- Inertial Proximal ADMM for Linearly Constrained Separable Convex Optimization
- Fractional Programming with Homogeneous Functions
- On Convergence Properties of a Subgradient Method
- Abstract convergence theorem for quasi-convex optimization problems with applications
- A Unified Augmented Lagrangian Approach to Duality and Exact Penalization
- Interior Gradient and Epsilon-Subgradient Descent Methods for Constrained Convex Minimization
- Convergence and efficiency of subgradient methods for quasiconvex minimization
