Relatively Smooth Convex Optimization by First-Order Methods, and Applications (Q4603043): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large step volumetric potential reduction algorithms for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Volumetric Barrier for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal and Efficient Designs of Experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4135211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Second-Order Feasibility Cone: Primal-Dual Representation and Efficient Projection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5791470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rounding of Polytopes in the Real Number Model of Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of approximating the maximal inscribed ellipsoid for a polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Equivalence of Two Extremum Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3967358 / 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: Primal-dual subgradient methods for convex problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gradient methods for minimizing composite functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3028166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of Minimum-Volume Covering Ellipsoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-Volume Ellipsoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Minimum Volume Covering Ellipsoid of Ellipsoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3149262 / rank
 
Normal rank

Revision as of 02:55, 15 July 2024

scientific article; zbMATH DE number 6838291
Language Label Description Also known as
English
Relatively Smooth Convex Optimization by First-Order Methods, and Applications
scientific article; zbMATH DE number 6838291

    Statements

    Relatively Smooth Convex Optimization by First-Order Methods, and Applications (English)
    0 references
    0 references
    0 references
    0 references
    14 February 2018
    0 references
    convex optimization
    0 references
    first-order method
    0 references
    d-optimal design
    0 references
    primal gradient method
    0 references
    dual averaging
    0 references

    Identifiers

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