First-order methods for convex optimization (Q6169988)

scientific article; zbMATH DE number 7711235

Language	Label	Description	Also known as
English	First-order methods for convex optimization	scientific article; zbMATH DE number 7711235

Statements

instance of

scholarly article

0 references

title

First-order methods for convex optimization (English)

0 references

0 references

0 references

0 references

EURO Journal on Computational Optimization

0 references

publication date

12 July 2023

0 references

full work available at URL

https://arxiv.org/abs/2101.00935

0 references

zbMATH Keywords

convex optimization

0 references

composite optimization

0 references

first-order methods

0 references

numerical algorithms

0 references

convergence rate

0 references

proximal mapping

0 references

proximity operator

0 references

Bregman divergence

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Katyusha: the first direct acceleration of stochastic gradient methods

0 references

Hessian Riemannian Gradient Flows in Convex Programming

0 references

Q4496016

0 references

Dual approaches to the minimization of strongly convex functionals with a simple structure under affine constraints

0 references

Q3266142

0 references

Singular Riemannian barrier methods and gradient-projection dynamical systems for constrained optimization

0 references

Alternating proximal algorithms for linearly constrained variational inequalities: application to domain decomposition for PDE's

0 references

Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity

0 references

A New Class of Alternating Proximal Minimization Algorithms with Costs-to-Move

0 references

Regularized Lotka-Volterra dynamical system as continuous proximal-like method in optimization.

0 references

Interior Gradient and Proximal Methods for Convex and Conic Optimization

0 references

Projected subgradient methods with non-Euclidean distances for non-differentiable convex minimization and variational inequalities

0 references

Duality Between Subgradient and Conditional Gradient Methods

0 references

Universal method of searching for equilibria and stochastic equilibria in transportation networks

0 references

Fixing and extending some recent results on the ADMM algorithm

0 references

Bregman Monotone Optimization Algorithms

0 references

A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications

0 references

Mirror descent and convex optimization problems with non-smooth inequality constraints

0 references

First-Order Methods in Optimization

0 references

FOM – a MATLAB toolbox of first-order methods for solving convex optimization problems

0 references

Linearly convergent away-step conditional gradient for non-strongly convex functions

0 references

Mirror descent and nonlinear projected subgradient methods for convex optimization.

0 references

A conditional gradient method with linear rate of convergence for solving convex linear systems

0 references

A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems

0 references

Q3079664

0 references

Smoothing and First Order Methods: A Unified Framework

0 references

The Ordered Subsets Mirror Descent Optimization Method with Applications to Tomography

0 references

Recursive algorithms, urn processes and chaining number of chain recurrent sets

0 references

Q3997575

0 references

Linearly Constrained Non-Lipschitz Optimization for Image Restoration

0 references

Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization

0 references

From error bounds to the complexity of first-order descent methods for convex functions

0 references

Barrier Operators and Associated Gradient-Like Dynamical Systems for Constrained Minimization Problems

0 references

Hessian Barrier Algorithms for Linearly Constrained Optimization Problems

0 references

Optimization Methods for Large-Scale Machine Learning

0 references

Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers

0 references

Q4821526

0 references

From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images

0 references

Q2809807

0 references

Statistics for high-dimensional data. Methods, theory and applications.

0 references

Bregman forward-backward operator splitting

0 references

The Dantzig selector: statistical estimation when $p$ is much larger than $n$. (With discussions and rejoinder).

0 references

Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information

0 references

A Tight Upper Bound on the Rate of Convergence of Frank-Wolfe Algorithm

0 references

Proximal minimization algorithm with $D$-functions

0 references

Prediction, Learning, and Games

0 references

A first-order primal-dual algorithm for convex problems with applications to imaging

0 references

The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent

0 references

Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions

0 references

Fast Primal-Dual Gradient Method for Strongly Convex Minimization Problems with Linear Constraints

0 references

Proximal Splitting Methods in Signal Processing

0 references

Signal Recovery by Proximal Forward-Backward Splitting

0 references

Dual subgradient algorithms for large-scale nonsmooth learning problems

0 references

Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids

0 references

Smooth Optimization with Approximate Gradient

0 references

An iterative thresholding algorithm for linear inverse problems with a sparsity constraint

0 references

Stochastic subgradient method converges on tame functions

0 references

First-order methods of smooth convex optimization with inexact oracle

0 references

An Interior Proximal Algorithm and the Exponential Multiplier Method for Semidefinite Programming

0 references

Compressed sensing

0 references

Q5396673

0 references

Stochastic Methods for Composite and Weakly Convex Optimization Problems

0 references

Rates of Convergence for Conditional Gradient Algorithms Near Singular and Nonsingular Extremals

0 references

Stochastic intermediate gradient method for convex problems with stochastic inexact oracle

0 references

An accelerated directional derivative method for smooth stochastic convex optimization

0 references

Hyperfast second-order local solvers for efficient statistically preconditioned distributed optimization

0 references

Generalized self-concordant analysis of Frank-Wolfe algorithms

0 references

On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators

0 references

Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system

0 references

Finite-Dimensional Variational Inequalities and Complementarity Problems

0 references

Exact augmented Lagrangian duality for mixed integer linear programming

0 references

Restarting the accelerated coordinate descent method with a rough strong convexity estimate

0 references

Accelerated, Parallel, and Proximal Coordinate Descent

0 references

New analysis and results for the Frank-Wolfe method

0 references

A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization

0 references

Stochastic intermediate gradient method for convex optimization problems

0 references

Universal method for stochastic composite optimization problems

0 references

Fast gradient descent for convex minimization problems with an oracle producing a $( \delta, L)$-model of function at the requested point

0 references

Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization I: A Generic Algorithmic Framework

0 references

Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization, II: Shrinking Procedures and Optimal Algorithms

0 references

Generalized uniformly optimal methods for nonlinear programming

0 references

Q3995612

0 references

An Accelerated Method for Derivative-Free Smooth Stochastic Convex Optimization

0 references

Some comments on Wolfe's ‘away step’

0 references

Accelerated primal-dual gradient descent with linesearch for convex, nonconvex, and nonsmooth optimization problems

0 references

Accelerated Bregman proximal gradient methods for relatively smooth convex optimization

0 references

Q4255531

0 references

Q2753173

0 references

An extension of the frank and Wolfe method of feasible directions

0 references

Non-convex Optimization for Machine Learning

0 references

Randomized first order algorithms with applications to $\ell _{1}$-minimization

0 references

Recursive aggregation of estimators by the mirror descent algorithm with averaging

0 references

Deterministic and stochastic primal-dual subgradient algorithms for uniformly convex minimization

0 references

Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start

0 references

Q3344923

0 references

An optimal method for stochastic composite optimization

0 references

First-order and stochastic optimization methods for machine learning

0 references

Conditional Gradient Sliding for Convex Optimization

0 references

Q5576518

0 references

Relatively Smooth Convex Optimization by First-Order Methods, and Applications

0 references

A First-Order Primal-Dual Algorithm with Linesearch

0 references

Q5618030

0 references

On the Convergence of Gradient-Like Flows with Noisy Gradient Input

0 references

Stochastic mirror descent dynamics and their convergence in monotone variational inequalities

0 references

An Accelerated Hybrid Proximal Extragradient Method for Convex Optimization and Its Implications to Second-Order Methods

0 references

Proximité et dualité dans un espace hilbertien

0 references

Linear convergence of first order methods for non-strongly convex optimization

0 references

Prox-Method with Rate of Convergence <i>O</i>(1/<i>t</i>) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems

0 references

Q3967358

0 references

Optimal methods of smooth convex minimization

0 references

Implementable tensor methods in unconstrained convex optimization

0 references

Q3320132

0 references

Excessive Gap Technique in Nonsmooth Convex Minimization

0 references

Smooth minimization of non-smooth functions

0 references

Dual extrapolation and its applications to solving variational inequalities and related problems

0 references

Accelerating the cubic regularization of Newton's method on convex problems

0 references

Primal-dual subgradient methods for convex problems

0 references

Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems

0 references

Gradient methods for minimizing composite functions

0 references

Universal gradient methods for convex optimization problems

0 references

Complexity bounds for primal-dual methods minimizing the model of objective function

0 references

Lectures on convex optimization

0 references

Q4324980

0 references

Random gradient-free minimization of convex functions

0 references

Efficiency of the Accelerated Coordinate Descent Method on Structured Optimization Problems

0 references

Weak convergence of the sequence of successive approximations for nonexpansive mappings

0 references

Restarting algorithms: sometimes there is free lunch

0 references

Some methods of speeding up the convergence of iteration methods

0 references

A Stochastic Approximation Method

0 references

Generalized equations and their solutions, part II: Applications to nonlinear programming

0 references

Q5599348

0 references

Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming

0 references

Monotone Operators and the Proximal Point Algorithm

0 references

Variational Analysis

0 references

Lectures on Stochastic Programming

0 references

Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization

0 references

Gradient methods for problems with inexact model of the objective

0 references

Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones

0 references

A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insights

0 references

Entropic Proximal Mappings with Applications to Nonlinear Programming

0 references

A simplified view of first order methods for optimization

0 references

Minimum-Volume Ellipsoids

0 references

An adaptive primal-dual framework for nonsmooth convex minimization

0 references

A Smooth Primal-Dual Optimization Framework for Nonsmooth Composite Convex Minimization

0 references

Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities

0 references

Forward-backward splitting with Bregman distances

0 references

Simplicial decomposition in nonlinear programming algorithms

0 references

Accelerated directional search with non-Euclidean prox-structure

0 references

Accelerated gradient-free optimization methods with a non-Euclidean proximal operator

0 references

A variational perspective on accelerated methods in optimization

0 references

Q4103334

0 references

Q5121146

0 references

Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing

0 references

Alternating direction method for covariance selection models

0 references

Identifiers

zbMATH Open document ID

0 references

0 references

10.1016/j.ejco.2021.100015

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6169988