Two convergent primal-dual hybrid gradient type methods for convex programming with linear constraints (Q6100752): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A customized proximal point algorithm for convex minimization with linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: PPA-like contraction methods for convex optimization: a framework using variational inequality approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2825037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5402636 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Lagrangian-PPA based prediction correction method for linearly constrained convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A prediction-correction-based primal-dual hybrid gradient method for linearly constrained convex minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A first-order primal-dual algorithm for convex problems with applications to imaging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Analysis of Primal-Dual Algorithms for a Saddle-Point Problem: From Contraction Perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: On convergence of the Arrow-Hurwicz method for saddle point problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel splitting augmented Lagrangian methods for monotone structured variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(O(1/t)\) convergence rate of the parallel descent-like method and parallel splitting augmented Lagrangian method for solving a class of variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(O(1/t)\) convergence rate of the projection and contraction methods for variational inequalities with Lipschitz continuous monotone operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of customized proximal point algorithms for linearly constrained convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-Dimensional Variational Inequalities and Complementarity Problems / rank
 
Normal rank

Revision as of 10:54, 1 August 2024

scientific article; zbMATH DE number 7700385
Language Label Description Also known as
English
Two convergent primal-dual hybrid gradient type methods for convex programming with linear constraints
scientific article; zbMATH DE number 7700385

    Statements

    Two convergent primal-dual hybrid gradient type methods for convex programming with linear constraints (English)
    0 references
    0 references
    0 references
    0 references
    22 June 2023
    0 references
    convex programming
    0 references
    primal-dual hybrid gradient method
    0 references
    global convergence
    0 references
    convergence rate
    0 references

    Identifiers