Work

Optimization Algorithm for Polynomial Approximation Models Based on Partial Coefficient Correction

Year: 2024

Type: conference-paper

Abstract: To balance the computational cost of single-step iteration and fully utilize the efficiency advantage of the quadratic polynomial approximation model in algorithm design, this paper proposes and tests derivative-free optimization algorithms for five types of partial coefficient correction in polynomial approximation models, including hub-spoke, hinge, closed loop, spoke, and support wheel. Specifically, a random strategy is introduced during the implementation of the algorithm. Numerical experiments demonstrate the effectiveness of the algorithm and the efficiency differences between different methods.

Source: International Conference on Communication and Information Processing (ICCIP)

DOI: 10.1145/3708657.3708776

Authors: Jie Cong Cao, Yue Xin Tong

Institution: Beijing University of Posts and Telecommunications

Language: English

Topic: Advanced Optimization Algorithms Research

Subfield: Numerical Analysis

Field: Mathematics

Domain: Physical Sciences

Open Access status: bronze

Funder: Beijing University of Posts and Telecommunications

OpenAlex ID: W4410858767

FWCI:

Cites: 5

Cited by:

Related to: 10