An adaptive high order method for finding third-order critical points of nonconvex optimization (Q2079692): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Adaptive Regularization Algorithms with Inexact Evaluations for Nonconvex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inexact restoration for derivative-free expensive function minimization and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the use of third-order models with fourth-order regularization for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluation Complexity for Nonlinear Constrained Optimization Using Unscaled KKT Conditions and High-Order Models / 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: Lower bounds for finding stationary points I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated Methods for NonConvex Optimization / 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: Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A concise second-order complexity analysis for unconstrained optimization using high-order regularized models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with Inexpensive Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inexact regularized Newton framework with a worst-case iteration complexity of $ {\mathscr O}(\varepsilon^{-3/2}) $ for nonconvex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal tests for scalar functions of several real variables at degenerate critical points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5396673 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized uniformly optimal methods for nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Trust-Region Subproblem using the Lanczos Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence and evaluation-complexity analysis of a regularized tensor-Newton method for solving nonlinear least-squares problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tensor Methods for Minimizing Convex Functions with Hölder Continuous Higher-Order Derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unified Adaptive Tensor Approximation Scheme to Accelerate Composite Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal High-Order Tensor Method for Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On High-order Model Regularization for Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some NP-complete problems in quadratic and nonlinear programming / 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: Accelerating the cubic regularization of Newton's method on convex problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementable tensor methods in unconstrained convex optimization / 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: The hierarchy of local minimums in polynomial optimization / rank
 
Normal rank

Latest revision as of 06:14, 30 July 2024

scientific article
Language Label Description Also known as
English
An adaptive high order method for finding third-order critical points of nonconvex optimization
scientific article

    Statements

    An adaptive high order method for finding third-order critical points of nonconvex optimization (English)
    0 references
    0 references
    0 references
    0 references
    30 September 2022
    0 references
    continuous optimization
    0 references
    nonconvex optimization
    0 references
    adaptive algorithm
    0 references
    higher-order method
    0 references
    third-order critical points
    0 references
    0 references

    Identifiers

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