Steepest descent methods for critical points in vector optimization problems
From MaRDI portal
Publication:3143359
DOI10.1080/00036811.2011.640629zbMath1252.49052OpenAlexW2094916180WikidataQ58304699 ScholiaQ58304699MaRDI QIDQ3143359
Thai Doan Chuong, Jen-Chih Yao
Publication date: 29 November 2012
Published in: Applicable Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00036811.2011.640629
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (11)
On \(q\)-steepest descent method for unconstrained multiobjective optimization problems ⋮ A study of Liu-Storey conjugate gradient methods for vector optimization ⋮ A modified Quasi-Newton method for vector optimization problem ⋮ Newton-like methods for efficient solutions in vector optimization ⋮ On the extension of the Hager-Zhang conjugate gradient method for vector optimization ⋮ Conditional gradient method for vector optimization ⋮ A steepest descent method for set optimization problems with set-valued mappings of finite cardinality ⋮ Nonsmooth steepest descent method by proximal subdifferentials in Hilbert spaces ⋮ Tikhonov-type regularization method for efficient solutions in vector optimization ⋮ Nonlinear Conjugate Gradient Methods for Vector Optimization ⋮ Newton-like methods for solving vector optimization problems
Cites Work
- Hybrid approximate proximal method with auxiliary variational inequality for vector optimization
- Critical points index for vector functions and vector optimization
- Global analysis and economics. II: Extension of a theorem of Debreu
- Global analysis and economics. III: Pareto Optima and price equilibria
- Global analysis and economics. IV: Finiteness and stability of equilibria with general consumption sets and production
- Exchange processes with price adjustment
- Invex functions and generalized convexity in multiobjective programming
- Steepest descent methods for multicriteria optimization.
- A steepest descent method for vector optimization
- Slow solutions of a differential inclusion and vector optimization
- A projected gradient method for vector optimization problems
- Approximate proximal methods in vector optimization
- On the choice of parameters for the weighting method in vector optimization
- Box-constrained multi-objective optimization: A gradient-like method without ``a priori scalarization
- Generalized deviations in risk analysis
- Newton's Method for Multiobjective Optimization
- Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
- Degrees of Efficiency and Degrees of Minimality
- Full convergence of the steepest descent method with inexact line searches
- Proximal Methods in Vector Optimization
This page was built for publication: Steepest descent methods for critical points in vector optimization problems
