Convergence of inexact quasisubgradient methods with extrapolation

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Numerical methods based on nonlinear programming (49M37)

Cites Work

A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
iPiano: inertial proximal algorithm for nonconvex optimization
Smooth minimization of non-smooth functions
Introductory lectures on convex optimization. A basic course.
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
A first-order primal-dual algorithm for convex problems with applications to imaging
Constrained optimization and image space analysis. Vol. 1: Separation of sets and optimality conditions
Generalized concavity
Inertial Douglas-Rachford splitting for monotone inclusion problems
Title not available (Why is that?)
Weak Sharp Minima in Mathematical Programming
Title not available (Why is that?)
Handbook of generalized convexity and generalized monotonicity
The effect of deterministic noise in subgradient methods
A Unified Augmented Lagrangian Approach to Duality and Exact Penalization
Asymptotic convergence of an inertial proximal method for unconstrained quasiconvex minimization
Quasiconvex optimization and location theory
Inexact subgradient methods for quasi-convex optimization problems
Interior proximal methods for quasiconvex optimization
Convergence of the projected gradient method for quasiconvex multiobjective optimization
Interior Gradient and Epsilon-Subgradient Descent Methods for Constrained Convex Minimization
Portfolio Optimization Under a Minimax Rule
An appropriate subdifferential for quasiconvex functions
Lower subdifferentiable functions and their minimization by cutting planes
Convergence and efficiency of subgradient methods for quasiconvex minimization
General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems
Inertial Proximal ADMM for Linearly Constrained Separable Convex Optimization
On properties of supporting and quasi-supporting vectors
On Convergence Properties of a Subgradient Method
Abstract convergence theorem for quasi-convex optimization problems with applications
Convergence rates of subgradient methods for quasi-convex optimization problems
Inertial Proximal Alternating Linearized Minimization (iPALM) for Nonconvex and Nonsmooth Problems
Fractional Programming with Homogeneous Functions
Generalized convexity, generalized monotonicity: recent results. Proceedings of the 5th symposium, Luminy, France, June 17--21, 1996
Linear Convergence of Proximal Gradient Algorithm with Extrapolation for a Class of Nonconvex Nonsmooth Minimization Problems
Aggregation functions and generalized convexity in fuzzy optimization and decision making
An inexact proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth optimization problems
Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions
Estimates of the labor cost of combined relaxation methods
Relative-error inertial-relaxed inexact versions of Douglas-Rachford and ADMM splitting algorithms

Cited In (2)

On the convergence of inexact quasi-newton methods
On a minimization problem of the maximum generalized eigenvalue: properties and algorithms

Uses Software

iPiano

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)