Proximal decomposition of convex optimization via an alternating linearization algorithm with inexact oracles

Convex programming (90C25) Numerical optimization and variational techniques (65K10) Nonsmooth analysis (49J52) Convex functions and convex programs in convex geometry (52A41)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
A novel robust principal component analysis method for image and video processing.
Convex proximal bundle methods in depth: a unified analysis for inexact oracles
An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems
Application of the alternating direction method of multipliers to separable convex programming problems
Approximations in proximal bundle methods and decomposition of convex programs
Composite convex optimization with global and local inexact oracles
An alternating linearization bundle method for a class of nonconvex optimization problem with inexact information
\(\mathcal{UV}\)-theory of a class of semidefinite programming and its applications
A class of alternating linearization algorithms for nonsmooth convex optimization
Computing proximal points of convex functions with inexact subgradients
Inexact alternating direction methods of multipliers for separable convex optimization
An alternating linearization method with inexact data for bilevel nonsmooth convex optimization
Exact matrix completion via convex optimization
Inexact Bundle Methods for Two-Stage Stochastic Programming
Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
Monotone Operators and the Proximal Point Algorithm
Variational Analysis
Proximal Decomposition Via Alternating Linearization
A Decomposition Algorithm for the Sums of the Largest Eigenvalues
On Solving the Convex Semi-Infinite Minimax Problems via Superlinear 𝒱𝒰 Incremental Bundle Technique with Partial Inexact Oracle
Quasidifferentiabilities of the expectation functions of random quasidifferentiable functions
Golden ratio algorithms with new stepsize rules for variational inequalities
A Linearized Alternating Direction Method of Multipliers with Substitution Procedure
Convex Analysis
Advances in convex analysis and global optimization. Honoring the memory of C. Carathéodory (1873-1950)
A proximal bundle method for nonsmooth nonconvex functions with inexact information
A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information

This page was built for publication: Proximal decomposition of convex optimization via an alternating linearization algorithm with inexact oracles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6593193)