A modified self-adaptive dual ascent method with relaxed stepsize condition for linearly constrained quadratic convex optimization (Q2691343): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.3934/jimo.2022101 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.3934/jimo.2022101 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4285270432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3266142 / 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: Relaxation Methods for Network Flow Problems with Convex Arc Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5580053 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Singular Value Thresholding Algorithm for Matrix Completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearized Bregman iterations for compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearized Bregman Iterations for Frame-Based Image Deblurring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lagrangean relaxation algorithm for the constrained matrix problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sequential updating scheme of the Lagrange multiplier for separable convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Split Bregman Method for L1-Regularized Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex programming in Hilbert space / 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: Fast linearized Bregman iteration for compressive sensing and sparse denoising / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangian dual coordinatewise maximization algorithm for network transportation problems with quadratic costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated Uzawa methods for convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational development of a lagrangian dual approach for quadratic networks / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.3934/JIMO.2022101 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:16, 19 December 2024

scientific article
Language Label Description Also known as
English
A modified self-adaptive dual ascent method with relaxed stepsize condition for linearly constrained quadratic convex optimization
scientific article

    Statements

    A modified self-adaptive dual ascent method with relaxed stepsize condition for linearly constrained quadratic convex optimization (English)
    0 references
    0 references
    29 March 2023
    0 references
    dual ascent method
    0 references
    quadratic optimization with linear constraints
    0 references
    self-adaptive stepsize
    0 references
    variational inequality
    0 references
    augmented Lagrangian algorithm
    0 references

    Identifiers

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