A simplified view of first order methods for optimization (Q1650767): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 09:26, 28 August 2024

scientific article

Language	Label	Description	Also known as
English	A simplified view of first order methods for optimization	scientific article

Statements

scholarly article

0 references

A simplified view of first order methods for optimization (English)

0 references

0 references

Mathematical Programming. Series A. Series B

0 references

publication date

13 July 2018

0 references

zbMATH Keywords

proximal framework

0 references

non-Euclidean Bregman distance

0 references

first order algorithms

0 references

convex and nonconvex minimization

0 references

descent lemma

0 references

Kurdyka-Łosiajewicz property

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10107-018-1284-2

0 references

On the convergence of the proximal algorithm for nonsmooth functions involving analytic features

0 references

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

0 references

0 references

Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods

0 references

0 references

Interior Gradient and Epsilon-Subgradient Descent Methods for Constrained Convex Minimization

0 references

Interior projection-like methods for monotone variational inequalities

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

Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels

0 references

0 references

Convex analysis and monotone operator theory in Hilbert spaces

0 references

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

0 references

First-Order Methods in Optimization

0 references

Mirror descent and nonlinear projected subgradient methods for convex optimization.

0 references

A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems

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

0 references

0 references

0 references

First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems

0 references

On the Convergence of the Proximal Point Algorithm for Convex Minimization

0 references

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

0 references

The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems

0 references

Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity

0 references

Proximal alternating linearized minimization for nonconvex and nonsmooth problems

0 references

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

0 references

0 references

On the weak convergence of an ergodic iteration for the solution of variational inequalities for monotone operators in Hilbert space

0 references

A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space

0 references

Proximal minimization algorithm with \(D\)-functions

0 references

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

0 references

Signal Recovery by Proximal Forward-Backward Splitting

0 references

0 references

Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming

0 references

A generalized proximal point algorithm for certain non-convex minimization problems

0 references

On gradients of functions definable in o-minimal structures

0 references

A proximal method for composite minimization

0 references

0 references

0 references

Proximité et dualité dans un espace hilbertien

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

0 references

Forward-backward splitting with Bregman distances

0 references

Weak convergence of the sequence of successive approximations for nonexpansive mappings

0 references

Convex Optimization in Signal Processing and Communications

0 references

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

0 references

Nonlinear rescaling and proximal-like methods in convex optimization

0 references

Variational Analysis

0 references

Convex Analysis

0 references

Monotone Operators and the Proximal Point Algorithm

0 references

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

0 references

Entropic Proximal Mappings with Applications to Nonlinear Programming

0 references

Convergence of Proximal-Like Algorithms

0 references

Approximation accuracy, gradient methods, and error bound for structured convex optimization

0 references

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

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/s10107-018-1284-2

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1650767

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1650767&oldid=37644702"