Evaluation Complexity for Nonlinear Constrained Optimization Using Unscaled KKT Conditions and High-Order Models (Q2802144): Difference between revisions

From MaRDI portal
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sequential optimality conditions for smooth constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Sequential Optimality Condition for Constrained Optimization and Algorithmic Consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of a Regularized Euclidean Residual Algorithm for Nonlinear Least-Squares / 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: Practical Augmented Lagrangian Methods for Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity / 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. 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: 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: On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of finding first-order critical points in constrained nonlinear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Evaluation Complexity of Cubic Regularization Methods for Potentially Rank-Deficient Nonlinear Least-Squares Problems and Its Relevance to Constrained Nonlinear Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained 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: Q5651510 / 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: On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrange Multipliers and Optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst case complexity of direct search / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1137/15m1031631 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2337385024 / rank
 
Normal rank

Latest revision as of 10:35, 30 July 2024

scientific article
Language Label Description Also known as
English
Evaluation Complexity for Nonlinear Constrained Optimization Using Unscaled KKT Conditions and High-Order Models
scientific article

    Statements

    Evaluation Complexity for Nonlinear Constrained Optimization Using Unscaled KKT Conditions and High-Order Models (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    25 April 2016
    0 references
    nonlinear programming
    0 references
    complexity
    0 references
    approximate KKT point
    0 references
    0 references

    Identifiers

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