Path-following gradient-based decomposition algorithms for separable convex optimization (Q2249817): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10898-013-0085-7 / rank
Normal rank
 
Property / arXiv ID
 
Property / arXiv ID: 1203.3742 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001523 / 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: A proximal-based deomposition method for compositions method for convex minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-level primal-dual proximal decomposition technique to solve large scale optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition Methods Based on Augmented Lagrangians: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual infeasible-interior-point algorithm for linear 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: Interior-point Lagrangian decomposition method for separable convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Subgradient Methods for Multi-Agent Optimization / 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: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing the Spectral Radius / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Convergence of an Augmented Lagrangian Decomposition Method for Sparse Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Inexact Perturbed Path-Following Method for Lagrangian Decomposition in Large-Scale Separable Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian dual method with self-concordant barriers for multi-stage stochastic convex programming / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10898-013-0085-7 / rank
 
Normal rank

Latest revision as of 16:32, 17 December 2024

scientific article
Language Label Description Also known as
English
Path-following gradient-based decomposition algorithms for separable convex optimization
scientific article

    Statements

    Path-following gradient-based decomposition algorithms for separable convex optimization (English)
    0 references
    0 references
    0 references
    0 references
    3 July 2014
    0 references
    path-following gradient method
    0 references
    dual fast gradient algorithm
    0 references
    separable convex optimization
    0 references
    smoothing technique
    0 references
    self-concordant barrier
    0 references
    parallel implementation
    0 references
    0 references
    0 references

    Identifiers