Pages that link to "Item:Q4602340"

The following pages link to On High-order Model Regularization for Constrained Optimization (Q4602340):

Displaying 28 items.

• 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)
• On large-scale unconstrained optimization and arbitrary regularization (Q2070329) (← 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)
• On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization (Q2089862) (← links)
• On constrained optimization with nonconvex regularization (Q2225521) (← links)
• Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary (Q2330649) (← links)
• A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization (Q2419564) (← links)
• A sequential adaptive regularisation using cubics algorithm for solving nonlinear equality constrained optimization (Q2696932) (← links)
• Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities (Q4634141) (← 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)
• Accelerated Regularized Newton Methods for Minimizing Composite Convex Functions (Q4646444) (← links)
• Tensor Methods for Minimizing Convex Functions with Hölder Continuous Higher-Order Derivatives (Q4971023) (← links)
• Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity (Q5000647) (← links)
• An Optimal High-Order Tensor Method for Convex Optimization (Q5026443) (← links)
• On high-order model regularization for multiobjective optimization (Q5038176) (← links)
• On the complexity of solving feasibility problems with regularized models (Q5038424) (← links)
• Tensor methods for finding approximate stationary points of convex functions (Q5038435) (← links)
• Inexact basic tensor methods for some classes of convex optimization problems (Q5043845) (← links)
• Diminishing stepsize methods for nonconvex composite problems via ghost penalties: from the general to the convex regular constrained case (Q5058371) (← 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)
• Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with Inexpensive Constraints (Q5217594) (← links)
• Iteration and evaluation complexity for the minimization of functions whose computation is intrinsically inexact (Q5235099) (← links)
• On inexact solution of auxiliary problems in tensor methods for convex optimization (Q5859013) (← links)
• Derivative-free separable quadratic modeling and cubic regularization for unconstrained optimization (Q6489314) (← links)