On relaxation of some customized proximal point algorithms for convex minimization: from variational inequality perspective (Q2419572): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q128123952, #quickstatements; #temporary_batch_1723642047871
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Singular Value Thresholding Algorithm for Matrix Completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proximal point algorithm revisit on the alternating direction method of multipliers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A first-order primal-dual algorithm for convex problems with applications to imaging / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the ergodic convergence rates of a first-order primal-dual algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to continuous optimization for imaging / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterative thresholding algorithm for linear inverse problems with a sparsity constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the global and linear convergence of the generalized alternating direction method of multipliers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel multi-block ADMM with \(o(1/k)\) convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-Dimensional Variational Inequalities and Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4144736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting Methods in Communication, Imaging, Science, and Engineering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modified Lagrangians in convex programming and their generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of ADMM-based algorithms for three-block separable convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: PPA-like contraction methods for convex optimization: a framework using variational inequality approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Analysis of Primal-Dual Algorithms for a Saddle-Point Problem: From Contraction Perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Block-wise Alternating Direction Method of Multipliers for Multiple-block Convex Programming and Beyond / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic framework of generalized primal-dual hybrid gradient methods for saddle point problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplier and gradient methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5618030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone Operators and the Proximal Point Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: New augmented Lagrangian-based proximal point algorithm for convex optimization with equality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Multiple-Block Separable Convex Minimization Problems Using Two-Block Alternating Direction Method of Multipliers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4908856 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bregmanized Nonlocal Regularization for Deconvolution and Sparse Reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified primal-dual algorithm framework based on Bregman iteration / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128123952 / rank
 
Normal rank

Latest revision as of 14:43, 14 August 2024

scientific article
Language Label Description Also known as
English
On relaxation of some customized proximal point algorithms for convex minimization: from variational inequality perspective
scientific article

    Statements

    On relaxation of some customized proximal point algorithms for convex minimization: from variational inequality perspective (English)
    0 references
    0 references
    13 June 2019
    0 references
    convex minimization
    0 references
    proximal point algorithm
    0 references
    relaxation
    0 references
    augmented Lagrangian method
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers