A Derivative-Free Method for Structured Optimization Problems

DOI10.1137/20M1337417zbMath1466.90051arXiv2005.05224OpenAlexW3151225265MaRDI QIDQ4987276

Francesco Rinaldi, Andrea Cristofari

Publication date: 3 May 2021

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2005.05224

zbMATH Keywords

large-scale optimizationdecomposition methodsderivative-free optimization

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)

Related Items (1)

Scalable subspace methods for derivative-free nonlinear least-squares optimization

Uses Software

• NEWUOA
• PSwarm
• KELLEY
• LIBLINEAR
• SDBOX
• SDPEN
• LCOBYQA
• CUTEst
• LINCOA
• CIFAR
• DFBOX_IMPR

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A derivative-free algorithm for linearly constrained optimization problems
• On fast trust region methods for quadratic models with linear constraints
• Globally convergent evolution strategies for constrained optimization
• Nonlinear programming and variational inequality problems. A unified approach
• How good are convex hull algorithms?
• Objective-derivative-free methods for constrained optimization
• The convex geometry of linear inverse problems
• CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
• Direct search based on probabilistic feasible descent for bound and linearly constrained problems
• An almost cyclic 2-coordinate descent method for singly linearly constrained problems
• A particle swarm pattern search method for bound constrained global optimization
• Geometry of interpolation sets in derivative free optimization
• Optimization with Sparsity-Inducing Penalties
• Sequential Penalty Derivative-Free Methods for Nonlinear Constrained Optimization
• PSwarm: a hybrid solver for linearly constrained global derivative-free optimization
• Using Sampling and Simplex Derivatives in Pattern Search Methods
• Developments of NEWUOA for minimization without derivatives
• Geometry of sample sets in derivative-free optimization: polynomial regression and underdetermined interpolation
• Active Set Identification for Linearly Constrained Minimization Without Explicit Derivatives
• Introduction to Derivative-Free Optimization
• Restricted simplicial decomposition: Computation and extensions
• Pattern Search Methods for Linearly Constrained Minimization
• Derivative-Free and Blackbox Optimization
• On the Global Convergence of Derivative-Free Methods for Unconstrained Optimization
• Benchmarking Derivative-Free Optimization Algorithms
• Derivative-free optimization methods
• Stationarity Results for Generating Set Search for Linearly Constrained Optimization
• A derivative-free algorithm for bound constrained optimization

This page was built for publication: A Derivative-Free Method for Structured Optimization Problems