Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming (Q4622887): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
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: Smoothing and First Order Methods: A Unified Framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variable smoothing algorithm for solving convex optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the acceleration of the double smoothing technique for unconstrained convex optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Double Smoothing Technique for Large-Scale Linearly Constrained Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-order methods of smooth convex optimization with inexact oracle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iteration-complexity of first-order penalty methods for convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic Mean / 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: Iteration complexity analysis of dual first-order methods for conic convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Application of a Smoothing Technique to Decomposition in Convex Optimization / 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: Prox-Method with Rate of Convergence <i>O</i>(1/<i>t</i>) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smooth minimization of non-smooth functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual extrapolation and its applications to solving variational inequalities and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gradient methods for minimizing composite functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgradient methods for huge-scale optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variational Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast inexact decomposition algorithms for large-scale separable convex optimization / rank
 
Normal rank

Latest revision as of 06:35, 18 July 2024

scientific article; zbMATH DE number 7024421
Language Label Description Also known as
English
Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming
scientific article; zbMATH DE number 7024421

    Statements

    Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming (English)
    0 references
    0 references
    0 references
    0 references
    18 February 2019
    0 references
    conic convex problems
    0 references
    smooth (augmented) dual functions
    0 references
    penalty functions
    0 references
    (augmented) dual first-order methods
    0 references
    penalty fast gradient methods
    0 references
    approximate primal solution
    0 references
    overall computational complexity
    0 references
    0 references

    Identifiers

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