Pages that link to "Item:Q1785005"

The following pages link to Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization (Q1785005):

Displaying 18 items.

• Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization (Q2001208) (← links)
• High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms (Q2020600) (← links)
• An adaptive high order method for finding third-order critical points of nonconvex optimization (Q2079692) (← links)
• On the geometric analysis of a quartic-quadratic optimization problem under a spherical constraint (Q2089778) (← links)
• A control-theoretic perspective on optimal high-order optimization (Q2089793) (← links)
• On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization (Q2089862) (← links)
• Finding second-order stationary points in constrained minimization: a feasible direction approach (Q2194125) (← links)
• On constrained optimization with nonconvex regularization (Q2225521) (← links)
• A decoupled first/second-order steps technique for nonconvex nonlinear unconstrained optimization with improved complexity bounds (Q2288191) (← links)
• Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary (Q2330649) (← links)
• Zeroth-order nonconvex stochastic optimization: handling constraints, high dimensionality, and saddle points (Q2696568) (← links)
• Tensor methods for finding approximate stationary points of convex functions (Q5038435) (← links)
• A Trust Region Method for Finding Second-Order Stationarity in Linearly Constrained Nonconvex Optimization (Q5124006) (← links)
• A Unified Adaptive Tensor Approximation Scheme to Accelerate Composite Convex Optimization (Q5131958) (← links)
• A concise second-order complexity analysis for unconstrained optimization using high-order regularized models (Q5210739) (← links)
• Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with Inexpensive Constraints (Q5217594) (← links)
• Trust-region algorithms: probabilistic complexity and intrinsic noise with applications to subsampling techniques (Q6170037) (← links)
• The evaluation complexity of finding high-order minimizers of nonconvex optimization (Q6200212) (← links)