Iteration complexity analysis of dual first-order methods for conic convex programming (Q2815553): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1409.1462 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <formula formulatype="inline"><tex Notation="TeX">$O(1/k)$</tex> </formula> Gradient Method for Network Resource Allocation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast dual proximal gradient algorithm for convex minimization and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal convergence from dual subgradient methods for convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangian Relaxation via Ballstep Subgradient Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ergodic convergence in subgradient optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity certification for dual gradient method: application to embedded MPC / 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: On linear convergence of a distributed dual gradient algorithm for linearly constrained separable convex problems / 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: Interior-point Lagrangian decomposition method for separable 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: Smooth minimization of non-smooth functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gradient methods for minimizing composite functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variational Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation accuracy, gradient methods, and error bound for structured convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Distributed Newton Method for Network Utility Maximization–I: Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal scaling of a gradient method for distributed resource allocation / rank
 
Normal rank

Latest revision as of 05:45, 12 July 2024

scientific article
Language Label Description Also known as
English
Iteration complexity analysis of dual first-order methods for conic convex programming
scientific article

    Statements

    Iteration complexity analysis of dual first-order methods for conic convex programming (English)
    0 references
    0 references
    0 references
    29 June 2016
    0 references
    conic convex problem
    0 references
    smooth dual function
    0 references
    dual first-order methods
    0 references
    aproximate primal feasible and suboptimal solution
    0 references
    rate of convergence
    0 references
    0 references

    Identifiers

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