A Predefined-Time Adaptive Algorithm for Optimization Problems

This paper proposes a predefined-time adaptive algorithm for the optimization problem with private inequality constraints. By designing algorithms, penalty parameters are designed to handle private inequality constraints, and through adaptive penalties, the parameters in the algorithm are adaptively adjusted according to the degree of violation of private inequality constraints by the state solution. Moreover, The smoothing method is also integrated into adaptive penalty, overcoming the difficulty of non smooth dynamic behavior of the objective function and adaptive penalty parameters. In addition, a predefined-time mechanism is introduced to enable the algorithm to converge within the predefined-time.

Authors

Institutions

Publication Details

Published
2024-12-13
DOI
https://doi.org/10.1109/icnc64304.2024.10987722
Primary Topic
Metaheuristic Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Predefined-Time Adaptive Algorithm for Optimization Problems

Sitian Qin, Haoze Li
1 links
Metaheuristic Optimization Algorithms Research
article

A Predefined-Time Adaptive Algorithm for Optimization Problems

Sitian Qin, Haoze Li
article en

Abstract

This paper proposes a predefined-time adaptive algorithm for the optimization problem with private inequality constraints. By designing algorithms, penalty parameters are designed to handle private inequality constraints, and through adaptive penalties, the parameters in the algorithm are adaptively adjusted according to the degree of violation of private inequality constraints by the state solution. Moreover, The smoothing method is also integrated into adaptive penalty, overcoming the difficulty of non smooth dynamic behavior of the objective function and adaptive penalty parameters. In addition, a predefined-time mechanism is introduced to enable the algorithm to converge within the predefined-time.

Harbin Institute of Technology (CN)
Openalex Percentile: Top 73%
Metaheuristic 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.