The following pages link to Coralia Cartis (Q263151):
Displayed 43 items.
- Active-set prediction for interior point methods using controlled perturbations (Q263153) (← links)
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results (Q535013) (← links)
- Phase transitions for greedy sparse approximation algorithms (Q629259) (← links)
- Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity (Q652287) (← links)
- Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming (Q1012253) (← links)
- Item:Q263151 (redirect page) (← links)
- Global convergence rate analysis of unconstrained optimization methods based on probabilistic models (Q1646566) (← links)
- Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization (Q1785005) (← links)
- Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties (Q2018512) (← links)
- Adaptive regularization with cubics on manifolds (Q2039233) (← links)
- Nonlinear matrix recovery using optimization on the Grassmann manifold (Q2105129) (← links)
- On monotonic estimates of the norm of the minimizers of regularized quadratic functions in Krylov spaces (Q2192591) (← links)
- A derivative-free Gauss-Newton method (Q2295977) (← links)
- Evaluation complexity bounds for smooth constrained nonlinear optimization using scaled KKT conditions and high-order models (Q2337587) (← links)
- On the complexity of finding first-order critical points in constrained nonlinear optimization (Q2452373) (← links)
- Bound-constrained global optimization of functions with low effective dimensionality using multiple random embeddings (Q2687068) (← links)
- On the Evaluation Complexity of Cubic Regularization Methods for Potentially Rank-Deficient Nonlinear Least-Squares Problems and Its Relevance to Constrained Nonlinear Optimization (Q2866197) (← links)
- Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization (Q2885470) (← links)
- On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization (Q2902870) (← links)
- Obituary for Mike Powell (Q2943841) (← links)
- A New and Improved Quantitative Recovery Analysis for Iterative Hard Thresholding Algorithms in Compressed Sensing (Q2978705) (← links)
- Compressed Sensing: How Sharp Is the Restricted Isometry Property? (Q3084491) (← links)
- On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming (Q3225248) (← links)
- Universal Regularization Methods: Varying the Power, the Smoothness and the Accuracy (Q4629334) (← links)
- Improving the Flexibility and Robustness of Model-based Derivative-free Optimization Solvers (Q4960952) (← links)
- A dimensionality reduction technique for unconstrained global optimization of functions with low effective dimensionality (Q5073888) (← links)
- Escaping local minima with local derivative-free methods: a numerical investigation (Q5093686) (← links)
- Evaluation Complexity of Algorithms for Nonconvex Optimization: Theory, Computation and Perspectives (Q5101935) (← links)
- Global rates of convergence for nonconvex optimization on manifolds (Q5113326) (← links)
- WORST-CASE EVALUATION COMPLEXITY AND OPTIMALITY OF SECOND-ORDER METHODS FOR NONCONVEX SMOOTH OPTIMIZATION (Q5122174) (← links)
- Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with Inexpensive Constraints (Q5217594) (← 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)
- Quantitative Recovery Conditions for Tree-Based Compressed Sensing (Q5280852) (← links)
- A note about the complexity of minimizing Nesterov's smooth Chebyshev–Rosenbrock function (Q5299905) (← links)
- Erratum to: ``Global rates of convergence for nonconvex optimization on manifolds'' (Q5857368) (← links)
- Scalable subspace methods for derivative-free nonlinear least-squares optimization (Q6038650) (← links)
- Global optimization using random embeddings (Q6160282) (← links)
- The evaluation complexity of finding high-order minimizers of nonconvex optimization (Q6200212) (← links)
- An exact tree projection algorithm for wavelets (Q6241190) (← links)
- Convergence Rate Analysis of a Stochastic Trust Region Method via Submartingales (Q6277859) (← links)
- Escaping local minima with derivative-free methods: a numerical investigation (Q6311759) (← links)
- Strong Evaluation Complexity Bounds for Arbitrary-Order Optimization of Nonconvex Nonsmooth Composite Functions (Q6333703) (← links)