Improved Algorithms Based on Trust Region Framework for Solving Unconstrained Derivative Free Optimization Problems

This paper is devoted to developing new derivative-free optimization (DFO) methods for solving optimization problems where derivative information is not available or cannot be calculated numerically. To overcome the computational difficulties arising from time-consuming estimations of the objective function, we propose two algorithms. One algorithm is a variant of the surrogate model-based DFO algorithm under the trust region method, where the surrogate model is formulated through sparse low-rank interpolation and quadratic polynomial interpolation. This algorithm serves as a comparative baseline. The second algorithm leverages the characteristics of the sparse regression model, which can handle sparsity and noise issues, to construct the surrogate model. The coefficients of the sparse surrogate model are then estimated using the alternating direction method of multipliers and refined through a correction strategy based on the R-square. Finally, numerical results, evaluated in terms of performance and data profiles, demonstrate the effectiveness and competitiveness of the proposed algorithms.

Authors

Institutions

Publication Details

Journal
Processes
Published
2024-12-04
DOI
https://doi.org/10.3390/pr12122753
Primary Topic
Advanced Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Improved Algorithms Based on Trust Region Framework for Solving Unconstrained Derivative Free Optimization Problems

Yongxia Liu, Te Xu
Processes
Advanced Optimization Algorithms Research
article

Improved Algorithms Based on Trust Region Framework for Solving Unconstrained Derivative Free Optimization Problems

Yongxia Liu, Te Xu
article en

Abstract

This paper is devoted to developing new derivative-free optimization (DFO) methods for solving optimization problems where derivative information is not available or cannot be calculated numerically. To overcome the computational difficulties arising from time-consuming estimations of the objective function, we propose two algorithms. One algorithm is a variant of the surrogate model-based DFO algorithm under the trust region method, where the surrogate model is formulated through sparse low-rank interpolation and quadratic polynomial interpolation. This algorithm serves as a comparative baseline. The second algorithm leverages the characteristics of the sparse regression model, which can handle sparsity and noise issues, to construct the surrogate model. The coefficients of the sparse surrogate model are then estimated using the alternating direction method of multipliers and refined through a correction strategy based on the R-square. Finally, numerical results, evaluated in terms of performance and data profiles, demonstrate the effectiveness and competitiveness of the proposed algorithms.

ProcessesVol. 12(12)
Qilu University of Technology (CN), Shandong Institute of Automation (CN), Shandong Academy of Sciences (CN), Northeastern University (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 66%
Advanced Optimization Algorithms Research
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.