Convergence of inexact quasisubgradient methods with extrapolation
From MaRDI portal
Publication:2139278
Recommendations
- Convergence and efficiency of subgradient methods for quasiconvex minimization
- Inexact subgradient methods for quasi-convex optimization problems
- Efficiency of inexact fixed point quasiconvex subgradient method
- Sequential subspace optimization for quasar-convex optimization problems with inexact gradient
- Convergence rates of subgradient methods for quasi-convex optimization problems
Cites work
- scientific article; zbMATH DE number 4164577 (Why is no real title available?)
- scientific article; zbMATH DE number 3435272 (Why is no real title available?)
- scientific article; zbMATH DE number 2121575 (Why is no real title available?)
- scientific article; zbMATH DE number 3894826 (Why is no real title available?)
- scientific article; zbMATH DE number 3282977 (Why is no real title available?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A Unified Augmented Lagrangian Approach to Duality and Exact Penalization
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Abstract convergence theorem for quasi-convex optimization problems with applications
- Aggregation functions and generalized convexity in fuzzy optimization and decision making
- An appropriate subdifferential for quasiconvex functions
- An inexact proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth optimization problems
- Asymptotic convergence of an inertial proximal method for unconstrained quasiconvex minimization
- Constrained optimization and image space analysis. Vol. 1: Separation of sets and optimality conditions
- Convergence and efficiency of subgradient methods for quasiconvex minimization
- Convergence of the projected gradient method for quasiconvex multiobjective optimization
- Convergence rates of subgradient methods for quasi-convex optimization problems
- Estimates of the labor cost of combined relaxation methods
- Fractional Programming with Homogeneous Functions
- General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems
- Generalized concavity
- Generalized convexity, generalized monotonicity: recent results. Proceedings of the 5th symposium, Luminy, France, June 17--21, 1996
- Handbook of generalized convexity and generalized monotonicity
- Inertial Douglas-Rachford splitting for monotone inclusion problems
- Inertial proximal ADMM for linearly constrained separable convex optimization
- Inertial proximal alternating linearized minimization (iPALM) for nonconvex and nonsmooth problems
- Inexact subgradient methods for quasi-convex optimization problems
- Interior Gradient and Epsilon-Subgradient Descent Methods for Constrained Convex Minimization
- Interior proximal methods for quasiconvex optimization
- Introductory lectures on convex optimization. A basic course.
- Linear convergence of proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth minimization problems
- Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions
- Lower subdifferentiable functions and their minimization by cutting planes
- On Convergence Properties of a Subgradient Method
- On properties of supporting and quasi-supporting vectors
- Portfolio optimization under a minimax rule
- Quasiconvex optimization and location theory
- Relative-error inertial-relaxed inexact versions of Douglas-Rachford and ADMM splitting algorithms
- Smooth minimization of non-smooth functions
- The effect of deterministic noise in subgradient methods
- Weak Sharp Minima in Mathematical Programming
- iPiano: inertial proximal algorithm for nonconvex optimization
Cited in
(4)
This page was built for publication: Convergence of inexact quasisubgradient methods with extrapolation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2139278)
