A class of customized proximal point algorithms for linearly constrained convex optimization (Q725706): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1015003
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Ming-Fang Ni / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s40314-016-0371-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2517952166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis and monotone operator theory in Hilbert spaces / rank
 
Normal rank
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: A Singular Value Thresholding Algorithm for Matrix Completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearized Bregman iterations for compressed sensing / 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: An iterative thresholding algorithm for linear inverse problems with a sparsity constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995612 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Split Bregman Method for L1-Regularized Problems / 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: PPA-like contraction methods for convex optimization: a framework using variational inequality approach / 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 Analysis of Primal-Dual Algorithms for a Saddle-Point Problem: From Contraction Perspective / 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: Multiplier and gradient methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated linearized Bregman method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual–primal proximal point algorithms for extended convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Proximal Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming with Applications to Imaging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed point and Bregman iterative methods for matrix rank minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating proximal gradient method for convex minimization / 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: Sparse Image and Signal Processing / 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: Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5402636 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bregmanized Nonlocal Regularization for Deconvolution and Sparse Reconstruction / rank
 
Normal rank

Latest revision as of 05:33, 16 July 2024

scientific article
Language Label Description Also known as
English
A class of customized proximal point algorithms for linearly constrained convex optimization
scientific article

    Statements

    A class of customized proximal point algorithms for linearly constrained convex optimization (English)
    0 references
    0 references
    0 references
    2 August 2018
    0 references
    convex optimization
    0 references
    proximal point algorithm
    0 references
    linear constraints
    0 references
    augmented Lagrangian method
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references