Derivative-free separable quadratic modeling and cubic regularization for unconstrained optimization

DOI10.1007/S10288-023-00541-9MaRDI QIDQ6489314

Rohollah Garmanjani, Marcos Raydan, A. L. Custódio

Publication date: 21 April 2024

Published in: 4OR (Search for Journal in Brave)

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56) Numerical interpolation (65D05)

Cites Work

On the optimal order of worst case complexity of direct search
A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization
On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization
Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
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
Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization
Worst case complexity of direct search
Separable cubic modeling and a trust-region strategy for unconstrained minimization with impact in global optimization
Incorporating minimum Frobenius norm models in direct search
Introductory lectures on convex optimization. A basic course.
Global convergence rate analysis of unconstrained optimization methods based on probabilistic models
Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization
Newton-type methods for non-convex optimization under inexact Hessian information
Large-scale unconstrained optimization using separable cubic modeling and matrix-free subspace minimization
On global minimizers of quadratic functions with cubic regularization
Algebraic rules for quadratic regularization of Newton's method
CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
Geometry of interpolation sets in derivative free optimization
Cubic regularization of Newton method and its global performance
Trust-Region Methods Without Using Derivatives: Worst Case Complexity and the NonSmooth Case
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
Geometry of sample sets in derivative-free optimization: polynomial regression and underdetermined interpolation
On the geometry phase in model-based algorithms for derivative-free optimization
Introduction to Derivative-Free Optimization
On High-order Model Regularization for Constrained Optimization
Adaptive cubic regularization methods with dynamic inexact Hessian information and applications to finite-sum minimization
Benchmarking Derivative-Free Optimization Algorithms
Global Convergence of General Derivative-Free Trust-Region Algorithms to First- and Second-Order Critical Points
Benchmarking optimization software with performance profiles.

This page was built for publication: Derivative-free separable quadratic modeling and cubic regularization for unconstrained optimization