Pages that link to "Item:Q2802144"
From MaRDI portal
The following pages link to Evaluation Complexity for Nonlinear Constrained Optimization Using Unscaled KKT Conditions and High-Order Models (Q2802144):
Displaying 18 items.
- A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms (Q1639726) (← links)
- Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization (Q1785005) (← links)
- Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization (Q2001208) (← links)
- An adaptive high order method for finding third-order critical points of nonconvex optimization (Q2079692) (← links)
- A control-theoretic perspective on optimal high-order optimization (Q2089793) (← links)
- Optimality conditions and global convergence for nonlinear semidefinite programming (Q2297647) (← links)
- An augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem (Q2301011) (← links)
- Direct search based on probabilistic feasible descent for bound and linearly constrained problems (Q2419520) (← links)
- On High-order Model Regularization for Constrained Optimization (Q4602340) (← links)
- On Regularization and Active-set Methods with Complexity for Constrained Optimization (Q4641664) (← links)
- Complexity Analysis of a Trust Funnel Algorithm for Equality Constrained Optimization (Q4641670) (← links)
- Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity (Q5000647) (← links)
- On high-order model regularization for multiobjective optimization (Q5038176) (← links)
- Error bound conditions and convergence of optimization methods on smooth and proximally smooth manifolds (Q5070619) (← links)
- A Unified Adaptive Tensor Approximation Scheme to Accelerate Composite Convex Optimization (Q5131958) (← links)
- On the Complexity of an Inexact Restoration Method for Constrained Optimization (Q5210514) (← links)
- Iteration and evaluation complexity for the minimization of functions whose computation is intrinsically inexact (Q5235099) (← links)
- A Newton-CG Based Augmented Lagrangian Method for Finding a Second-Order Stationary Point of Nonconvex Equality Constrained Optimization with Complexity Guarantees (Q6116250) (← links)
