Principled analyses and design of first-order methods with inexact proximal operators (Q6165584)

scientific article; zbMATH DE number 7720806

Language	Label	Description	Also known as
English	Principled analyses and design of first-order methods with inexact proximal operators	scientific article; zbMATH DE number 7720806

Statements

instance of

scholarly article

0 references

title

Principled analyses and design of first-order methods with inexact proximal operators (English)

0 references

0 references

0 references

0 references

Mathematical Programming. Series A. Series B

0 references

publication date

1 August 2023

0 references

full work available at URL

https://arxiv.org/abs/2006.06041

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Relative-error inertial-relaxed inexact versions of Douglas-Rachford and ADMM splitting algorithms

0 references

On inexact relative-error hybrid proximal extragradient, forward-backward and Tseng's modified forward-backward methods with inertial effects

0 references

Numerical methods for nondifferentiable convex optimization

0 references

Convex analysis and monotone operator theory in Hilbert spaces

0 references

A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems

0 references

A Hybrid Proximal-Extragradient Algorithm with Inertial Effects

0 references

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

0 references

On the Subdifferentiability of Convex Functions

0 references

An iterative solution of a variational inequality for certain monotone operators in Hilbert space

0 references

Enlargement of monotone operators with applications to variational inequalities

0 references

An additive subfamily of enlargements of a maximally monotone operator

0 references

Q4252814

0 references

Q4945768

0 references

A Variable Metric Proximal Point Algorithm for Monotone Operators

0 references

An introduction to continuous optimization for imaging

0 references

Proximal Splitting Methods in Signal Processing

0 references

Coupling the proximal point algorithm with approximation methods

0 references

Convergence of some algorithms for convex minimization

0 references

On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions

0 references

Worst-Case Convergence Analysis of Inexact Gradient and Newton Methods Through Semidefinite Programming Performance Estimation

0 references

First-order methods of smooth convex optimization with inexact oracle

0 references

Online Learning With Inexact Proximal Online Gradient Descent Algorithms

0 references

On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables

0 references

Optimal complexity and certification of Bregman first-order methods

0 references

Efficient first-order methods for convex minimization: a constructive approach

0 references

Performance of first-order methods for smooth convex minimization: a novel approach

0 references

An optimal variant of Kelley's cutting-plane method

0 references

Approximate iterations in Bregman-function-based proximal algorithms

0 references

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

0 references

A practical relative error criterion for augmented Lagrangians

0 references

Approximate ADMM algorithms derived from Lagrangian splitting

0 references

Relative-error approximate versions of Douglas-Rachford splitting and special cases of the ADMM

0 references

Q3038523

0 references

Descentwise inexact proximal algorithms for smooth optimization

0 references

Q5187042

0 references

Q5689624

0 references

New Proximal Point Algorithms for Convex Minimization

0 references

Accelerated proximal point method for maximally monotone operators

0 references

Optimized first-order methods for smooth convex minimization

0 references

Another Look at the Fast Iterative Shrinkage/Thresholding Algorithm (FISTA)

0 references

Optimizing the efficiency of first-order methods for decreasing the gradient of smooth convex functions

0 references

Q4026938

0 references

Analysis and Design of Optimization Algorithms via Integral Quadratic Constraints

0 references

On the convergence rate of the Halpern-iteration

0 references

Catalyst Acceleration for First-order Convex Optimization: from Theory to Practice

0 references

Splitting Algorithms for the Sum of Two Nonlinear Operators

0 references

Q5618030

0 references

Q5633161

0 references

System analysis via integral quadratic constraints

0 references

Inexact proximal \(\epsilon\)-subgradient methods for composite convex optimization problems

0 references

On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic Mean

0 references

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

0 references

Q5728711

0 references

Proximité et dualité dans un espace hilbertien

0 references

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

0 references

Q3320132

0 references

Gradient methods for minimizing composite functions

0 references

Inexact accelerated high-order proximal-point methods

0 references

Inexact High-Order Proximal-Point Methods with Auxiliary Search Procedure

0 references

Ergodic convergence to a zero of the sum of monotone operators in Hilbert space

0 references

Some methods of speeding up the convergence of iteration methods

0 references

A dual approach to solving nonlinear programming problems by unconstrained optimization

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

Q2805243

0 references

Operator Splitting Performance Estimation: Tight Contraction Factors and Optimal Parameter Selection

0 references

Finding the forward-Douglas-Rachford-forward method

0 references

Q4903682

0 references

Primal recovery from consensus-based dual decomposition for distributed convex optimization

0 references

A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator

0 references

Q4704621

0 references

Q4762531

0 references

Error bounds for proximal point subproblems and associated inexact proximal point algorithms

0 references

An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions

0 references

A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS*

0 references

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

0 references

A weakly convergent fully inexact Douglas-Rachford method with relative error tolerance

0 references

Exact Worst-Case Performance of First-Order Methods for Composite Convex Optimization

0 references

Smooth strongly convex interpolation and exact worst-case performance of first-order methods

0 references

Accelerated and Inexact Forward-Backward Algorithms

0 references

Convergence analysis of an inexact three-operator splitting algorithm

0 references

Identifiers

zbMATH Open document ID

0 references

0 references

10.1007/s10107-022-01903-7

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:6165584