Pages that link to "Item:Q4649640"

The following pages link to An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity (Q4649640):

Displaying 36 items.

• Interior-point methods for nonconvex nonlinear programming: cubic regularization (Q457205) (← links)
• Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models (Q526842) (← links)
• Complexity bounds for second-order optimality in unconstrained optimization (Q657654) (← links)
• Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis (Q1734769) (← 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)
• High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms (Q2020600) (← links)
• Adaptive regularization for nonconvex optimization using inexact function values and randomly perturbed derivatives (Q2052165) (← links)
• Finding second-order stationary points in constrained minimization: a feasible direction approach (Q2194125) (← links)
• Projected adaptive cubic regularization algorithm with derivative-free filter technique for box constrained optimization (Q2244360) (← links)
• A note on inexact gradient and Hessian conditions for cubic regularized Newton's method (Q2294286) (← links)
• On global minimizers of quadratic functions with cubic regularization (Q2329649) (← links)
• Algebraic rules for quadratic regularization of Newton's method (Q2340522) (← links)
• Recent advances in trust region algorithms (Q2349124) (← links)
• An interior affine scaling cubic regularization algorithm for derivative-free optimization subject to bound constraints (Q2357423) (← links)
• Direct search based on probabilistic feasible descent for bound and linearly constrained problems (Q2419520) (← links)
• On the complexity of finding first-order critical points in constrained nonlinear optimization (Q2452373) (← links)
• Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization (Q2515043) (← links)
• On the use of iterative methods in cubic regularization for unconstrained optimization (Q2515064) (← links)
• Majorization-minimization-based Levenberg-Marquardt method for constrained nonlinear least squares (Q2696927) (← links)
• A sequential adaptive regularisation using cubics algorithm for solving nonlinear equality constrained optimization (Q2696932) (← links)
• Evaluation Complexity for Nonlinear Constrained Optimization Using Unscaled KKT Conditions and High-Order Models (Q2802144) (← 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)
• Stochastic analysis of an adaptive cubic regularization method under inexact gradient evaluations and dynamic Hessian accuracy (Q5034938) (← links)
• Model-Based Derivative-Free Methods for Convex-Constrained Optimization (Q5043286) (← links)
• A Trust Region Method for Finding Second-Order Stationarity in Linearly Constrained Nonconvex Optimization (Q5124006) (← links)
• Stochastic Conditional Gradient++: (Non)Convex Minimization and Continuous Submodular Maximization (Q5148398) (← links)
• Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with Inexpensive Constraints (Q5217594) (← links)
• Subdivision-Based Nonlinear Multiscale Cloth Simulation (Q5241261) (← links)
• Adaptive Regularization Algorithms with Inexact Evaluations for Nonconvex Optimization (Q5244400) (← links)
• Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimization (Q5248241) (← links)
• On the Evaluation Complexity of Constrained Nonlinear Least-Squares and General Constrained Nonlinear Optimization Using Second-Order Methods (Q5253577) (← links)
• A filter sequential adaptive cubic regularization algorithm for nonlinear constrained optimization (Q6109884) (← links)
• Worst-case complexity of an SQP method for nonlinear equality constrained stochastic optimization (Q6126655) (← links)