An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints (Q255080): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10957-015-0757-1 / rank
Normal rank
 
Property / author
 
Property / author: Zhi-You Wu / rank
Normal rank
 
Property / author
 
Property / author: Zhi-You Wu / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C46 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 65Y05 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6552290 / rank
 
Normal rank
Property / zbMATH Keywords
 
convex optimization
Property / zbMATH Keywords: convex optimization / rank
 
Normal rank
Property / zbMATH Keywords
 
dual decomposition
Property / zbMATH Keywords: dual decomposition / rank
 
Normal rank
Property / zbMATH Keywords
 
inexact gradient method
Property / zbMATH Keywords: inexact gradient method / rank
 
Normal rank
Property / zbMATH Keywords
 
suboptimality and constraint violations
Property / zbMATH Keywords: suboptimality and constraint violations / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10957-015-0757-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W242781686 / 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: Inexact alternating-direction-based contraction methods for separable linearly constrained convex optimization / 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 parallel splitting method for separable convex programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Accelerated Dual Gradient-Projection Algorithm for Embedded Linear Model Predictive Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: DISTRIBUTED PROXIMAL-GRADIENT METHOD FOR CONVEX OPTIMIZATION WITH INEQUALITY CONSTRAINTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gradient-free method for nonsmooth distributed optimization / 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: An Inexact Perturbed Path-Following Method for Lagrangian Decomposition in Large-Scale Separable Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smooth minimization of non-smooth functions / 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: Introductory lectures on convex optimization. A basic course. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Inexact Accelerated Proximal Gradient Method for Large Scale Linearly Constrained Convex SDP / 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: 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: Smooth Optimization with Approximate Gradient / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated and Inexact Forward-Backward Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An accelerated inexact proximal point algorithm for convex minimization / 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: Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10957-015-0757-1 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:34, 9 December 2024

scientific article
Language Label Description Also known as
English
An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints
scientific article

    Statements

    An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    9 March 2016
    0 references
    convex optimization
    0 references
    dual decomposition
    0 references
    inexact gradient method
    0 references
    suboptimality and constraint violations
    0 references
    0 references

    Identifiers