An Implicit Smoothing-enabled Algorithm for Strongly Convex Stochastic Multiobjective Optimization with Equilibrium Constraints

Stochastic multiobjective optimization has at-tract widespread attention in real-world scenarios. However, the current work mainly focuses on the gradient-based algorithms and there is a lack of effective methods for gradient-free problems. In this paper, we consider strongly convex stochastic multiobjective optimization problem with equilibrium constraints (SMOPEC) which may not be differ-entiable. By ultilizing a local spherical smoothing approxi-mation framework the zeroth-order method for this problem is presented, and the convergence analysis of the proposed algorithm is also provided under adequate assumptions. Finally, numerical experiment is conducted to verify the effectiveness of the proposed algorithm.

Authors

Institutions

Publication Details

Published
2024-10-18
DOI
https://doi.org/10.1109/ntci64025.2024.10776264
Primary Topic
Advanced Multi-Objective Optimization Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Implicit Smoothing-enabled Algorithm for Strongly Convex Stochastic Multiobjective Optimization with Equilibrium Constraints

Yong Zhao, Wei Deng
Advanced Multi-Objective Optimization Algorithms
article

An Implicit Smoothing-enabled Algorithm for Strongly Convex Stochastic Multiobjective Optimization with Equilibrium Constraints

Yong Zhao, Wei Deng
article en

Abstract

Stochastic multiobjective optimization has at-tract widespread attention in real-world scenarios. However, the current work mainly focuses on the gradient-based algorithms and there is a lack of effective methods for gradient-free problems. In this paper, we consider strongly convex stochastic multiobjective optimization problem with equilibrium constraints (SMOPEC) which may not be differ-entiable. By ultilizing a local spherical smoothing approxi-mation framework the zeroth-order method for this problem is presented, and the convergence analysis of the proposed algorithm is also provided under adequate assumptions. Finally, numerical experiment is conducted to verify the effectiveness of the proposed algorithm.

Chongqing Jiaotong University (CN)
Openalex Percentile: Top 73%
Advanced Multi-Objective Optimization Algorithms
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.