Adaptive Mirror Descent Algorithms for Convex and Strongly Convex Optimization Problems with Functional Constraints (Q4973261): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q127312014, #quickstatements; #temporary_batch_1722491441236
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Truss Topology Design via Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-Dual Subgradient Method for Huge-Scale Linear Conic 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: Gradient sliding for composite 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: Q3889672 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3967357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5532163 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5566712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The CoMirror algorithm for solving nonsmooth constrained convex problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Modern Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mirror descent and convex optimization problems with non-smooth inequality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mirror descent and constrained online optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3320132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual mirror descent method for constraint stochastic optimization problems / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1134/s1990478919030165 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2971110912 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127312014 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:55, 1 August 2024

scientific article; zbMATH DE number 7139192
Language Label Description Also known as
English
Adaptive Mirror Descent Algorithms for Convex and Strongly Convex Optimization Problems with Functional Constraints
scientific article; zbMATH DE number 7139192

    Statements

    Adaptive Mirror Descent Algorithms for Convex and Strongly Convex Optimization Problems with Functional Constraints (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 December 2019
    0 references
    adaptive mirror descent method
    0 references
    Lipschitz condition
    0 references
    Lipschitz gradient
    0 references
    Lipschitz Hessian
    0 references
    strongly convex function
    0 references
    technique of restarts
    0 references

    Identifiers

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