New augmented Lagrangian-based proximal point algorithm for convex optimization with equality constraints (Q727234): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: RecPF / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: FTVd / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PDCO / 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/s10957-016-0991-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2519079961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491042 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Atomic Decomposition by Basis Pursuit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decoding by Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Alternating Minimization Algorithm for Total Variation Image Reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient TVL1 Algorithm for Deblurring Multichannel Images Corrupted by Impulsive Noise / 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: Exact matrix completion via convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robustness of the hybrid extragradient proximal-point algorithm. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of Karmarkar's projective algorithm for convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3690580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3038523 / 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: Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probing the Pareto Frontier for Basis Pursuit Solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Augmented Lagrangian Approach to the Constrained Optimization Formulation of Imaging Inverse Problems / 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: On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplier methods: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proximal-based deomposition method for compositions method for convex minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing / 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: A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signal Recovery by Proximal Forward-Backward Splitting / 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: A unified primal-dual algorithm framework based on Bregman iteration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearized Bregman iterations for compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of the linearized Bregman iteration for ℓ₁-norm minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis and Generalizations of the Linearized Bregman Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smooth minimization of non-smooth functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation / rank
 
Normal rank

Latest revision as of 03:06, 13 July 2024

scientific article
Language Label Description Also known as
English
New augmented Lagrangian-based proximal point algorithm for convex optimization with equality constraints
scientific article

    Statements

    New augmented Lagrangian-based proximal point algorithm for convex optimization with equality constraints (English)
    0 references
    0 references
    0 references
    6 December 2016
    0 references
    0 references
    convex optimization
    0 references
    proximal point algorithm
    0 references
    augmented Lagrangian
    0 references
    sparse optimization
    0 references
    compressed sensing
    0 references
    algorithm
    0 references
    convergence
    0 references
    numerical result
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references