Reducing the Complexity of Two Classes of Optimization Problems by Inexact Accelerated Proximal Gradient Method (Q5883312)

scientific article; zbMATH DE number 7669682

Language	Label	Description	Also known as
English	Reducing the Complexity of Two Classes of Optimization Problems by Inexact Accelerated Proximal Gradient Method	scientific article; zbMATH DE number 7669682

Statements

instance of

scholarly article

0 references

title

Reducing the Complexity of Two Classes of Optimization Problems by Inexact Accelerated Proximal Gradient Method (English)

0 references

0 references

0 references

SIAM Journal on Optimization

0 references

publication date

30 March 2023

0 references

zbMATH Keywords

first-order method

0 references

constrained optimization

0 references

saddle-point nonsmooth optimization

0 references

describes a project that uses

glasso

0 references

ConstrainedLasso

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1137/22m1469584

0 references

cites work

A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems

0 references

Smoothing and First Order Methods: A Unified Framework

0 references

Robust principal component analysis?

0 references

Exact matrix completion via convex optimization

0 references

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

0 references

Smoothing proximal gradient method for general structured sparse regression

0 references

On Degrees of Freedom of Projection Estimators With Applications to Multivariate Nonparametric Regression

0 references

Optimal Primal-Dual Methods for a Class of Saddle Point Problems

0 references

Accelerated schemes for a class of variational inequalities

0 references

Decentralized and parallel primal and dual accelerated methods for stochastic convex programming problems

0 references

Q3093270

0 references

Sparse inverse covariance estimation with the graphical lasso

0 references

Algorithms for Fitting the Constrained Lasso

0 references

A Primal-Dual Algorithm with Line Search for General Convex-Concave Saddle Point Problems

0 references

Inertial accelerated primal-dual methods for linear equality constrained convex optimization problems

0 references

An Accelerated HPE-Type Algorithm for a Class of Composite Convex-Concave Saddle-Point Problems

0 references

Multiplier and gradient methods

0 references

Accelerated linearized Bregman method

0 references

An Inexact Accelerated Proximal Gradient Method for Large Scale Linearly Constrained Convex SDP

0 references

Inexact accelerated augmented Lagrangian methods

0 references

Accelerated Bregman method for linearly constrained $\ell _1-\ell _2$ minimization

0 references

Complexity of a Quadratic Penalty Accelerated Inexact Proximal Point Method for Solving Linearly Constrained Nonconvex Composite Programs

0 references

Accelerated inexact composite gradient methods for nonconvex spectral optimization problems

0 references

Gradient sliding for composite optimization

0 references

Communication-efficient algorithms for decentralized and stochastic optimization

0 references

Iteration-complexity of first-order penalty methods for convex programming

0 references

Iteration-complexity of first-order augmented Lagrangian methods for convex programming

0 references

Accelerated gradient sliding for structured convex optimization

0 references

Conditional Gradient Sliding for Convex Optimization

0 references

Decentralized Accelerated Gradient Methods With Increasing Penalty Parameters

0 references

An adaptive accelerated proximal gradient method and its homotopy continuation for sparse 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

Excessive Gap Technique in Nonsmooth Convex Minimization

0 references

Smooth minimization of non-smooth functions

0 references

Gradient methods for minimizing composite functions

0 references

Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems

0 references

Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization

0 references

Coordinate-friendly structures, algorithms and applications

0 references

Q4151662

0 references

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

0 references

Faster Lagrangian-Based Methods in Convex Optimization

0 references

Accelerated Uzawa methods for convex optimization

0 references

Q4864293

0 references

Sparsity and Smoothness Via the Fused Lasso

0 references

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

0 references

Accelerated and Inexact Forward-Backward Algorithms

0 references

Accelerated First-Order Primal-Dual Proximal Methods for Linearly Constrained Composite Convex Programming

0 references

Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming

0 references

First-Order Methods for Problems with $O$(1) Functional Constraints Can Have Almost the Same Convergence Rate as for Unconstrained Problems

0 references

Proximal gradient method for huberized support vector machine

0 references

A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion

0 references

Analysis and Generalizations of the Linearized Bregman Method

0 references

Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing

0 references

Model Selection and Estimation in Regression with Grouped Variables

0 references

Accelerated Stochastic Algorithms for Convex-Concave Saddle-Point Problems

0 references

Identifiers

DOI

10.1137/22M1469584

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5883312