A Derivative-Free Method for Structured Optimization Problems
From MaRDI portal
Abstract: Structured optimization problems are ubiquitous in fields like data science and engineering. The goal in structured optimization is using a prescribed set of points, called atoms, to build up a solution that minimizes or maximizes a given function. In the present paper, we want to minimize a black-box function over the convex hull of a given set of atoms, a problem that can be used to model a number of real-world applications. We focus on problems whose solutions are sparse, i.e., solutions that can be obtained as a proper convex combination of just a few atoms in the set, and propose a suitable derivative-free inner approximation approach that nicely exploits the structure of the given problem. This enables us to properly handle the dimensionality issues usually connected with derivative-free algorithms, thus getting a method that scales well in terms of both the dimension of the problem and the number of atoms. We analyze global convergence to stationary points. Moreover, we show that, under suitable assumptions, the proposed algorithm identifies a specific subset of atoms with zero weight in the final solution after finitely many iterations. Finally, we report numerical results showing the effectiveness of the proposed method.
Recommendations
- Exploiting Problem Structure in Derivative Free Optimization
- Objective-derivative-free methods for constrained optimization
- Derivative-free optimization methods
- A derivative-free algorithm for linearly constrained optimization problems
- Derivative-free methods for mixed-integer constrained optimization problems
- Derivative-free methods for mixed-integer nonsmooth constrained optimization
- A derivative-free method for linearly constrained nonsmooth optimization
- Derivative-free optimization methods for finite minimax problems
- A derivative-free algorithm for bound constrained optimization
- Derivative-Free Optimization
Cites work
- A derivative-free algorithm for bound constrained optimization
- A derivative-free algorithm for linearly constrained optimization problems
- A particle swarm pattern search method for bound constrained global optimization
- Active set identification for linearly constrained minimization without explicit derivatives
- An almost cyclic 2-coordinate descent method for singly linearly constrained problems
- An unconstrained optimization test functions collection
- Benchmarking Derivative-Free Optimization Algorithms
- Convex optimization algorithms
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Derivative-free and blackbox optimization
- Derivative-free optimization methods
- Developments of NEWUOA for minimization without derivatives
- Direct search based on probabilistic feasible descent for bound and linearly constrained problems
- Geometry of interpolation sets in derivative free optimization
- Geometry of sample sets in derivative-free optimization: polynomial regression and underdetermined interpolation
- Globally convergent evolution strategies for constrained optimization
- How good are convex hull algorithms?
- scientific article; zbMATH DE number 1274356 (Why is no real title available?)
- scientific article; zbMATH DE number 2002582 (Why is no real title available?)
- scientific article; zbMATH DE number 3441150 (Why is no real title available?)
- Introduction to Derivative-Free Optimization
- LIBLINEAR: a library for large linear classification
- Nonlinear programming and variational inequality problems. A unified approach
- Objective-derivative-free methods for constrained optimization
- On fast trust region methods for quadratic models with linear constraints
- On the Global Convergence of Derivative-Free Methods for Unconstrained Optimization
- Optimization with sparsity-inducing penalties
- Pattern Search Methods for Linearly Constrained Minimization
- PSwarm: a hybrid solver for linearly constrained global derivative-free optimization
- Restricted simplicial decomposition: Computation and extensions
- Sequential penalty derivative-free methods for nonlinear constrained optimization
- Stationarity Results for Generating Set Search for Linearly Constrained Optimization
- The convex geometry of linear inverse problems
- The NEWUOA software for unconstrained optimization without derivatives
- Using Sampling and Simplex Derivatives in Pattern Search Methods
Cited in
(12)- An optimized derivative-free form of the Potra-Pták method
- Derivative-free methods for mixed-integer constrained optimization problems
- scientific article; zbMATH DE number 6514307 (Why is no real title available?)
- Derivative-free optimization and filter methods to solve nonlinear constrained problems
- scientific article; zbMATH DE number 3920218 (Why is no real title available?)
- On the numerical performance of finite-difference-based methods for derivative-free optimization
- Scalable subspace methods for derivative-free nonlinear least-squares optimization
- Derivative-free bound-constrained optimization for solving structured problems with surrogate models
- Retraction-based direct search methods for derivative free Riemannian optimization
- Direct-search methods in the year 2025: theoretical guarantees and algorithmic paradigms
- An interior point method for nonlinear constrained derivative-free optimization
- A derivative-free optimization algorithm based on conditional moments
Describes a project that uses
Uses Software
This page was built for publication: A Derivative-Free Method for Structured Optimization Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4987276)
