A Newton-type proximal gradient method for nonlinear multi-objective optimization problems

DOI10.1080/10556788.2022.2157000zbMath1522.90085arXiv2205.04200OpenAlexW4313575371MaRDI QIDQ6175566

Md Abu Talhamainuddin Ansary

Publication date: 24 July 2023

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2205.04200

zbMATH Keywords

nonsmooth optimizationmulti-objective optimizationconvex optimizationcritical pointproximal gradient method

Mathematics Subject Classification ID

Convex programming (90C25) Multi-objective and goal programming (90C29) Numerical optimization and variational techniques (65K10) Numerical methods based on nonlinear programming (49M37)

Cites Work

• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Gradient methods for minimizing composite functions
• On continuation methods for non-linear bi-objective optimization: towards a certified interval-based approach
• Multiobjective optimization. Interactive and evolutionary approaches
• Steepest descent methods for multicriteria optimization.
• A fast dual proximal gradient algorithm for convex minimization and applications
• A sequential quadratic programming method for constrained multi-objective optimization problems
• Nonsmooth multiobjective programming with quasi-Newton methods
• A subgradient method for multiobjective optimization
• Proximal gradient methods for multiobjective optimization and their applications
• Equispaced Pareto front construction for constrained bi-objective optimization
• Convergence rates analysis of a multiobjective proximal gradient method
• A Method for Constrained Multiobjective Optimization Based on SQP Techniques
• Proximal Newton-Type Methods for Minimizing Composite Functions
• Singular Continuation: Generating Piecewise Linear Approximations to Pareto Sets via Global Analysis
• Non-dominated Sorting Based Multi/Many-Objective Optimization: Two Decades of Research and Application
• Newton's Method for Multiobjective Optimization
• The Proximal Point Method for Locally Lipschitz Functions in Multiobjective Optimization with Application to the Compromise Problem
• Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization
• A sequential quadratically constrained quadratic programming technique for a multi-objective optimization problem
• A Globally Convergent SQCQP Method for Multiobjective Optimization Problems
• A New Predictor Corrector Variant for Unconstrained Bi-objective Optimization Problems
• Multicriteria Optimization
• Proximal Methods in Vector Optimization
• A Subgradient Method for Vector Optimization Problems
• Evolutionary Algorithms for Solving Multi-Objective Problems
• Generalized homotopy approach to multiobjective optimization.

This page was built for publication: A Newton-type proximal gradient method for nonlinear multi-objective optimization problems