Fast inexact decomposition algorithms for large-scale separable convex optimization (Q2790883): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2172030407 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1212.4275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem / 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: Improved Dual Decomposition Based Optimization for DSL Dynamic Spectrum Management / 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 / cites work
 
Property / cites work: Q4001523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3712130 / 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: Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling / 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: Two-level primal-dual proximal decomposition technique to solve large scale optimization problems / 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: A Parallel Algorithm for a Class of Convex Programs / 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: Application of the alternating direction method of multipliers to separable convex programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Multiple-Splitting Algorithms for Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating direction splittings for block angular parallel optimization / 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 Projection-Proximal Methods for Convex Programming and Variational Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition Based Interior Point Methods for Two-Stage Stochastic Convex Quadratic Programs with Recourse / 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: Mean value cross decomposition for nonlinear convex problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of the method of partial inverses to convex programming: Decomposition / 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: A Monotone+Skew Splitting Model for Composite Monotone Inclusions in Duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proximal decomposition method for solving convex variational inverse 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: 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: Smooth minimization of non-smooth functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excessive Gap Technique in Nonsmooth Convex Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4235027 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank

Latest revision as of 13:30, 11 July 2024

scientific article
Language Label Description Also known as
English
Fast inexact decomposition algorithms for large-scale separable convex optimization
scientific article

    Statements

    Fast inexact decomposition algorithms for large-scale separable convex optimization (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 March 2016
    0 references
    primal-dual algorithm
    0 references
    smoothing technique
    0 references
    excessive gap
    0 references
    Lagrangian decomposition
    0 references
    distributed and parallel algorithm
    0 references
    separable convex optimization
    0 references
    0 references
    0 references
    0 references

    Identifiers