Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Proximal Quasi-Newton Methods for Multiobjective Optimization Problems (2108.00125v2)

Published 31 Jul 2021 in math.OC

Abstract: We introduce some new proximal quasi-Newton methods for unconstrained multiobjective optimization problems (in short, UMOP), where each objective function is the sum of a twice continuously differentiable strongly convex function and a proper lower semicontinuous convex but not necessarily differentiable function. We propose proximal BFGS method, proximal self-scaling BFGS method, and proximal Huang BFGS method for (UMOP) with both line searches and without line searches cases. Under mild assumputions, we show that each accumulation point of the sequence generated by these algorithms, if exists, is a Pareto stationary point of the (UMOP). Moreover, we present their applications in both constrained multiobjective optimization problems and robust multiobjective optimization problems. In particular, for robust multiobjective optimization problems, we show that the subproblems of proximal quasi-Newton algorithms can be regarded as quadratic minimization problems with quadratic inequality constraints. Numerical experiments are also carried out to verify the effectiveness of the proposed proximal quasi-Newton methods.

Summary

We haven't generated a summary for this paper yet.