Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming (Q2220658): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q127350704, #quickstatements; #temporary_batch_1722291251637
 
(7 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Yang-yang Xu / rank
Normal rank
 
Property / author
 
Property / author: Yang-yang Xu / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CVX / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2969771825 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1711.05812 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear Programming / 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: Penalty/Barrier Multiplier Methods for Convex Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3151174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical comparison of augmented Lagrangian algorithms for nonconvex 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: Q4821526 / 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: Randomized primal-dual proximal block coordinate updates / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Alternating Direction Methods of Multipliers: A Historical Perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Convergence of the Proximal Point Algorithm for Convex Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Proximal Point Algorithms for Convex Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplier and gradient methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inexact accelerated augmented Lagrangian methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated Bregman method for linearly constrained \(\ell _1-\ell _2\) minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iteration-complexity of first-order augmented Lagrangian methods for convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iteration complexity analysis of multi-block ADMM for a family of convex minimization without strong convexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Nonergodic Convergence Rate of an Inexact Augmented Lagrangian Framework for Composite Convex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rate Analysis of Inexact Dual First-Order Methods Application to Dual Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Inexact Gradient Augmented Lagrangian Methods: Application to Constrained MPC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgradient methods for saddle-point problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introductory lectures on convex optimization. A basic course. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gradient methods for minimizing composite functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Accelerated Linearized Alternating Direction Method of Multipliers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual approach to solving nonlinear programming problems by unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multiplier method of Hestenes and Powell applied to convex programming / 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: On the convergence of the exponential multiplier method for convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated First-Order Primal-Dual Proximal Methods for Linearly Constrained Composite Convex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asynchronous parallel primal-dual block coordinate update methods for affinely constrained convex programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated primal-dual proximal block coordinate updating methods for constrained convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Parallel Algorithm with an $O(1/t)$ Convergence Rate for General Convex Programs / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127350704 / rank
 
Normal rank

Latest revision as of 12:52, 30 July 2024

scientific article
Language Label Description Also known as
English
Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming
scientific article

    Statements

    Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming (English)
    0 references
    25 January 2021
    0 references
    augmented Lagrangian method (ALM)
    0 references
    nonlinearly constrained problem
    0 references
    first-order method
    0 references
    global convergence rate
    0 references
    iteration complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references