On the complexity of finding first-order critical points in constrained nonlinear optimization (Q2452373): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Phillipe L. Toint / rank
Normal rank
 
Property / author
 
Property / author: Phillipe L. Toint / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q58185701 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2097311548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Convergence of Successive Linear-Quadratic Programming Algorithms / 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: Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note about the complexity of minimizing Nesterov's smooth Chebyshev–Rosenbrock function / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Trust-Region Methods for Multiscale Nonlinear Optimization / 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: Cubic regularization of Newton method and its global performance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Black-Box Complexity of Local Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst case complexity of direct search / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:16, 8 July 2024

scientific article
Language Label Description Also known as
English
On the complexity of finding first-order critical points in constrained nonlinear optimization
scientific article

    Statements

    On the complexity of finding first-order critical points in constrained nonlinear optimization (English)
    0 references
    0 references
    0 references
    0 references
    2 June 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    evaluation complexity
    0 references
    worst-case analysis
    0 references
    constrained nonlinear optimization
    0 references
    0 references
    0 references