A parameterized proximal point algorithm for separable convex optimization (Q1800446): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
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: Proximal algorithms for multicomponent image recovery problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Atomic Decomposition by Basis Pursuit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust principal component analysis? / 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: Proximal Methods for Cohypomonotone Operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximal Thresholding Algorithm for Minimization over Orthonormal Bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse / 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: Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming / 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: Modified Lagrangians in convex programming and their generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A customized proximal point algorithm for convex minimization with linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearized alternating direction method of multipliers with Gaussian back substitution for separable convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the proximal Jacobian decomposition of ALM for multiple-block separable convex minimization problems and its relationship to ADMM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Study on the Symmetric Version of ADMM with Larger Step Sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximal point algorithms for multi-criteria optimization with the difference of convex objective functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A NEW MODEL FOR SPARSE AND LOW-RANK MATRIX DECOMPOSITION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximité et dualité dans un espace hilbertien / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5618030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of customized proximal point algorithms for linearly constrained convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proximal partially parallel splitting method for separable convex programs / rank
 
Normal rank

Latest revision as of 01:04, 17 July 2024

scientific article
Language Label Description Also known as
English
A parameterized proximal point algorithm for separable convex optimization
scientific article

    Statements

    A parameterized proximal point algorithm for separable convex optimization (English)
    0 references
    0 references
    0 references
    0 references
    23 October 2018
    0 references
    separable convex programming
    0 references
    proximal point algorithm
    0 references
    global convergence
    0 references
    statistical learning
    0 references
    0 references
    0 references
    0 references

    Identifiers