Dual–primal proximal point algorithms for extended convex programming (Q5266145): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1080/00207160.2014.945920 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2014038035 / 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 Singular Value Thresholding Algorithm for Matrix Completion / 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: Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-Dimensional Variational Inequalities and Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3038523 / 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: A dual algorithm for the solution of nonlinear variational problems via finite element approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual proximal point algorithm for constrained convex programs / 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: An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new inexact alternating directions method for monotone variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating Direction Method with Gaussian Back Substitution for Separable Convex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone Operators and the Proximal Point Algorithm / rank
 
Normal rank

Latest revision as of 13:58, 10 July 2024

scientific article; zbMATH DE number 6467862
Language Label Description Also known as
English
Dual–primal proximal point algorithms for extended convex programming
scientific article; zbMATH DE number 6467862

    Statements

    Dual–primal proximal point algorithms for extended convex programming (English)
    0 references
    0 references
    0 references
    0 references
    30 July 2015
    0 references
    convergence rate
    0 references
    dual-primal
    0 references
    convex programming
    0 references
    linear constraints
    0 references
    proximal point algorithm
    0 references
    0 references

    Identifiers