Primal-dual subgradient methods for convex problems (Q116219): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Interior projection-like methods for monotone variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4872459 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two ``well-known'' properties of subgradient optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mirror descent and nonlinear projected subgradient methods for convex optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ordered Subsets Mirror Descent Optimization Method with Applications to Tomography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prox-Method with Rate of Convergence <i>O</i>(1/<i>t</i>) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point 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: 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: Q5566712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187067 / rank
 
Normal rank

Revision as of 13:36, 1 July 2024

scientific article
Language Label Description Also known as
English
Primal-dual subgradient methods for convex problems
scientific article

    Statements

    Identifiers