Globally convergent Newton-type methods for multiobjective optimization
type: Item
instance of: scholarly article
title: Globally convergent Newton-type methods for multiobjective optimization
zbMATH Open document ID: 1502.90165
author: F. S. Lima
author: L. F. Prudente
author: M. L. N. Gonçalves
published in: Computational Optimization and Applications
publication date: 2022-10-04T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 49M15
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 7596179
zbMATH Keywords: multiobjective optimization
zbMATH Keywords: Newton method
zbMATH Keywords: global convergence
zbMATH Keywords: numerical experiments
describes a project that uses: NBI
describes a project that uses: LAPACK
describes a project that uses: minpack
describes a project that uses: ALGENCAN
MaRDI profile type: Publication
full work available at URL: s10589-022-00414-7
OpenAlex ID: W4296182520
cites work: LAPACK Users' Guide
cites work: A modified Quasi-Newton method for vector optimization problem
cites work: Conditional gradient method for multiobjective optimization
cites work: Practical Augmented Lagrangian Methods for Constrained Optimization
cites work: Proximal Methods in Vector Optimization
cites work: Direct Multisearch for Multiobjective Optimization
cites work: Convergence Properties of the BFGS Algoritm
cites work: A perfect example for the BFGS method
cites work: Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
cites work: Benchmarking optimization software with performance profiles.
cites work: Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems
cites work: Newton's Method for Multiobjective Optimization
cites work: Steepest descent methods for multicriteria optimization.
cites work: Inexact projected gradient method for vector optimization
cites work: Proper efficiency and the theory of vector maximization
cites work: On the extension of the Hager-Zhang conjugate gradient method for vector optimization
cites work: A projected gradient method for vector optimization problems
cites work: A quadratically convergent Newton method for vector optimization
cites work: A steepest descent method for vector optimization
cites work: Generalized homotopy approach to multiobjective optimization.
cites work: Singular Continuation: Generating Piecewise Linear Approximations to Pareto Sets via Global Analysis
cites work: Nonlinear Conjugate Gradient Methods for Vector Optimization
cites work: A Wolfe Line Search Algorithm for Vector Optimization
cites work: The BFGS method with exact line searches fails for non-convex objective functions
cites work: On the divergence of line search methods
cites work: Box-constrained multi-objective optimization: A gradient-like method without ``a priori'' scalarization
cites work: Nonmonotone line searches for unconstrained multiobjective optimization problems
cites work: Testing Unconstrained Optimization Software
cites work: Q5491447
cites work: Quasi-Newton's method for multiobjective optimization
cites work: Nonmonotone gradient methods for vector optimization with a portfolio optimization application
cites work: Convergence of stochastic search algorithms to finite size Pareto set approximations
cites work: The multiobjective steepest descent direction is not Lipschitz continuous, but is Hölder continuous
cites work: Extended Newton Methods for Multiobjective Optimization: Majorizing Function Technique and Convergence Analysis
DOI: 10.1007/S10589-022-00414-7
description: scientific article; zbMATH DE number 7596179