Complexity of gradient descent for multiobjective optimization (Q5198047): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Add wikidata reference.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2889351029 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A continuous gradient-like dynamical approach to Pareto-optimization in Hilbert spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-Order Methods in Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximal Methods in Vector Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trust region globalization strategy for the nonconvex unconstrained multiobjective optimization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton's Method for Multiobjective Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steepest descent methods for multicriteria optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence theorems in vector optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear Conjugate Gradient Methods for Vector Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3320132 / 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: Worst case complexity of direct search / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129318439 / rank
 
Normal rank

Latest revision as of 10:39, 16 December 2024

scientific article; zbMATH DE number 7111869
Language Label Description Also known as
English
Complexity of gradient descent for multiobjective optimization
scientific article; zbMATH DE number 7111869

    Statements

    Complexity of gradient descent for multiobjective optimization (English)
    0 references
    0 references
    0 references
    0 references
    2 October 2019
    0 references
    multiobjective optimization
    0 references
    gradient descent
    0 references
    steepest descent
    0 references
    global rates
    0 references
    worst-case complexity
    0 references

    Identifiers