A refined proximal algorithm for nonconvex multiobjective optimization in Hilbert spaces

DOI10.1007/S10898-024-01453-6MaRDI QIDQ6983489zbMATH OpenFDO

Authors G. C. Bento, J. X. da Cruz Neto, J. O. Lopes, Boris S. Mordukhovich, P. R. Silva Filho

Publication date 14 May 2025

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10898-024-01453-6

zbMATH Keywords

multi-objective programmingproximal point algorithmlocally Lipschitz-continuous functionsweakly Pareto point

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonconvex programming, global optimization (90C26) Nonsmooth analysis (49J52) Programming in abstract spaces (90C48)

Cites work

• A Proximal-Type Method for Convex Vector Optimization Problem in Banach Spaces
• A logarithmic-quadratic proximal point scalarization method for multiobjective programming
• A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets
• A proximal point-type method for multicriteria optimization
• A scalarization proximal point method for quasiconvex multiobjective minimization
• An interior proximal method in vector optimization
• Approximate proximal methods in vector optimization
• Directionally Lipschitzian Functions and Subdifferential Calculus
• Duality for multiobjective optimization via nonlinear Lagrangian functions
• Duality in Vector Optimization
• Hybrid approximate proximal algorithms for efficient solutions in vector optimization
• Newton's method for multiobjective optimization
• Pareto solutions as limits of collective traps: an inexact multiobjective proximal point algorithm
• Proximal Methods in Vector Optimization
• Proximal point method for locally Lipschitz functions in multiobjective optimization of Hadamard manifolds
• Some remarks on proximal point algorithm in scalar and vectorial cases
• Subdifferential properties of quasiconvex and pseudoconvex functions: Unified approach
• Tangential approximations
• The proximal point method for locally Lipschitz functions in multiobjective optimization with application to the compromise problem
• Variational Analysis
• Vector optimization. Set-valued and variational analysis.
• Weak Pareto-optimal necessary conditions in a nondifferentiable multiobjective program on a Banach space

Cited in

(1)

• A hybrid gradient method for vector optimization problems

This page was built for publication: A refined proximal algorithm for nonconvex multiobjective optimization in Hilbert spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6983489)