Derivative-free separable quadratic modeling and cubic regularization for unconstrained optimization
From MaRDI portal
Publication:6489314
Recommendations
- A derivative-free algorithm based on simple model for unconstrained optimization
- Separable cubic modeling and a trust-region strategy for unconstrained minimization with impact in global optimization
- Large-scale unconstrained optimization using separable cubic modeling and matrix-free subspace minimization
- On convergence analysis of a derivative-free trust region algorithm for constrained optimization with separable structure
- An interior affine scaling cubic regularization algorithm for derivative-free optimization subject to bound constraints
Cites work
- A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
- Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
- Adaptive cubic regularization methods with dynamic inexact Hessian information and applications to finite-sum minimization
- Algebraic rules for quadratic regularization of Newton's method
- Benchmarking Derivative-Free Optimization Algorithms
- Benchmarking optimization software with performance profiles.
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization
- Cubic regularization of Newton method and its global performance
- Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization
- Geometry of interpolation sets in derivative free optimization
- Geometry of sample sets in derivative-free optimization: polynomial regression and underdetermined interpolation
- Global convergence of general derivative-free trust-region algorithms to first- and second-order critical points
- Global convergence rate analysis of unconstrained optimization methods based on probabilistic models
- Incorporating minimum Frobenius norm models in direct search
- Introduction to Derivative-Free Optimization
- Introductory lectures on convex optimization. A basic course.
- Large-scale unconstrained optimization using separable cubic modeling and matrix-free subspace minimization
- Newton-type methods for non-convex optimization under inexact Hessian information
- On High-order Model Regularization for Constrained Optimization
- On global minimizers of quadratic functions with cubic regularization
- On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization
- On the geometry phase in model-based algorithms for derivative-free optimization
- On the optimal order of worst case complexity of direct search
- On the oracle complexity of first-order and derivative-free algorithms for smooth nonconvex minimization
- Self-Correcting Geometry in Model-Based Algorithms for Derivative-Free Unconstrained Optimization
- Separable cubic modeling and a trust-region strategy for unconstrained minimization with impact in global optimization
- Trust-region methods without using derivatives: worst case complexity and the nonsmooth case
- Worst case complexity of direct search
- Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
This page was built for publication: Derivative-free separable quadratic modeling and cubic regularization for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6489314)
