A Model-Based Derivative-Free Optimization Algorithm for Partially Separable Problems

We propose UPOQA, a derivative-free optimization algorithm for partially separable unconstrained problems, leveraging quadratic interpolation and a structured trust-region framework. By decomposing the objective into element functions, UPOQA constructs underdetermined element models and solves subproblems efficiently via a modified projected gradient method. Innovations include an approximate projection operator for structured trust regions, improved management of elemental radii and models, a starting point search mechanism, and support for hybrid black-white-box optimization, etc. Numerical experiments on 85 CUTEst problems demonstrate that \texttt{UPOQA} can significantly reduce the number of function evaluations. To quantify the impact of exploiting partial separability, we introduce the speed-up profile to further evaluate the acceleration effect. Results show that the speed-up of UPOQA over baselines is less significant in low-precision scenarios but becomes more pronounced in high-precision scenarios. Applications to quantum variational problems further validate its practical utility.

Publication Details

Journal
ArXiv.org
Published
2025-06-27
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Model-Based Derivative-Free Optimization Algorithm for Partially Separable Problems

ArXiv.org
Quantum Computing Algorithms and Architecture
article

A Model-Based Derivative-Free Optimization Algorithm for Partially Separable Problems

article en

Abstract

We propose UPOQA, a derivative-free optimization algorithm for partially separable unconstrained problems, leveraging quadratic interpolation and a structured trust-region framework. By decomposing the objective into element functions, UPOQA constructs underdetermined element models and solves subproblems efficiently via a modified projected gradient method. Innovations include an approximate projection operator for structured trust regions, improved management of elemental radii and models, a starting point search mechanism, and support for hybrid black-white-box optimization, etc. Numerical experiments on 85 CUTEst problems demonstrate that \texttt{UPOQA} can significantly reduce the number of function evaluations. To quantify the impact of exploiting partial separability, we introduce the speed-up profile to further evaluate the acceleration effect. Results show that the speed-up of UPOQA over baselines is less significant in low-precision scenarios but becomes more pronounced in high-precision scenarios. Applications to quantum variational problems further validate its practical utility.

ArXiv.org
Openalex Percentile: Top 73%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

A Model-Based Derivative-Free Optimization Algorithm for Partially Separable Problems · ArXiv.org (2025) | TGRS Research Map | TGRS