A Homotopy Framework for Constrained Multiobjective Optimization
Abstract
We develop a homotopy continuation framework for computing Karush--Kuhn--Tucker (KKT) points of constrained multiobjective optimization problems. The proposed homotopy map continuously deforms an easily solvable system into the KKT system associated with the original multiobjective problem, yielding a deterministic continuation path. Under the stated regularity and reference-point cone avoidance assumptions, we establish the existence of a smooth, bounded continuation path whose set of accumulation points as the homotopy parameter approaches zero is nonempty and consists of KKT points. The framework is implemented using two numerical continuation algorithms including an enhanced pseudo-arclength predictor--corrector strategy with adaptive step-size control and branch-restarting mechanisms to improve robustness for challenging nonconvex and degenerate problems. Numerical experiments demonstrate that the proposed method remains effective even when initialized from nonfeasible points, indicating practical robustness beyond the theoretical guarantees. Comparative studies evaluate the proposed framework against classical scalarization approaches and the evolutionary algorithms. Experiments on benchmark problems, disconnected and nonconvex multiobjective problems, analytically solvable three-objective problems, and a multiobjective IEEE 5-bus optimal power flow problem demonstrate the ability of the framework to compute KKT points in a variety of constrained settings. The results also highlight the effects of initialization and the limitations of continuation-based methods in recovering complete Pareto-front coverage. Overall, the proposed framework provides a deterministic and interpretable approach to computing Pareto-critical (KKT) points in constrained multiobjective optimization.
Related
- Solving Multiobjective Linear Set Optimization Problems
- Stochastic Augmented Lagrangian Framework with Second-Order Convergence Guarantees for Nonconvex Expectation-Constrained Optimization
- Optimality and Exact Moment-SDP Formulations for Robust Two-Stage Convex Polynomial Multiobjective Optimization
- NomadBBO: A direct-search framework for constrained mixed-variable blackbox optimization in Python
- Expected Hypervolume Maximization for Multiobjective Optimization under Uncertainties
BibTeX
@misc{ogunleye2026homotopy,
title = {{A Homotopy Framework for Constrained Multiobjective Optimization}},
author = {Olaoluwa Ogunleye and Guangming Yao and Jianhua Zhang and Manh Bui},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2605.00003},
eprint = {2605.00003},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2605.00003},
}
RIS
TY - UNPB
TI - A Homotopy Framework for Constrained Multiobjective Optimization
AU - Olaoluwa Ogunleye
AU - Guangming Yao
AU - Jianhua Zhang
AU - Manh Bui
PY - 2026
DA - 2026/10/15
PB - arXiv
DO - 10.48550/arxiv.2605.00003
UR - https://arxiv.org/abs/2605.00003
AB - We develop a homotopy continuation framework for computing Karush--Kuhn--Tucker (KKT) points of constrained multiobjective optimization problems. The proposed homotopy map continuously deforms an easily solvable system into the KKT system associated with the original multiobjective problem, yielding a deterministic continuation path. Under the stated regularity and reference-point cone avoidance assumptions, we establish the existence of a smooth, bounded continuation path whose set of accumulation points as the homotopy parameter approaches zero is nonempty and consists of KKT points. The framework is implemented using two numerical continuation algorithms including an enhanced pseudo-arclength predictor--corrector strategy with adaptive step-size control and branch-restarting mechanisms to improve robustness for challenging nonconvex and degenerate problems. Numerical experiments demonstrate that the proposed method remains effective even when initialized from nonfeasible points, indicating practical robustness beyond the theoretical guarantees. Comparative studies evaluate the proposed framework against classical scalarization approaches and the evolutionary algorithms. Experiments on benchmark problems, disconnected and nonconvex multiobjective problems, analytically solvable three-objective problems, and a multiobjective IEEE 5-bus optimal power flow problem demonstrate the ability of the framework to compute KKT points in a variety of constrained settings. The results also highlight the effects of initialization and the limitations of continuation-based methods in recovering complete Pareto-front coverage. Overall, the proposed framework provides a deterministic and interpretable approach to computing Pareto-critical (KKT) points in constrained multiobjective optimization.
ER -