A modified Quasi-Newton method for vector optimization problem
From MaRDI portal
Publication:3453403
DOI10.1080/02331934.2014.947500zbMath1327.90275OpenAlexW2127519119MaRDI QIDQ3453403
Md Abu Talhamainuddin Ansary, Geetanjali Panda
Publication date: 27 November 2015
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2014.947500
Numerical mathematical programming methods (65K05) Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53) Numerical methods based on nonlinear programming (49M37)
Related Items (23)
Multiple reduced gradient method for multiobjective optimization problems ⋮ On \(q\)-steepest descent method for unconstrained multiobjective optimization problems ⋮ A study of Liu-Storey conjugate gradient methods for vector optimization ⋮ A sequential quadratically constrained quadratic programming technique for a multi-objective optimization problem ⋮ A quasi-Newton method with Wolfe line searches for multiobjective optimization ⋮ The multiobjective steepest descent direction is not Lipschitz continuous, but is Hölder continuous ⋮ Variable metric method for unconstrained multiobjective optimization problems ⋮ Spectral conjugate gradient methods for vector optimization problems ⋮ Newton’s method for uncertain multiobjective optimization problems under finite uncertainty sets ⋮ On the extension of the Hager-Zhang conjugate gradient method for vector optimization ⋮ Adaptive sampling stochastic multigradient algorithm for stochastic multiobjective optimization ⋮ Memory gradient method for multiobjective optimization ⋮ A limited memory quasi-Newton approach for multi-objective optimization ⋮ A Globally Convergent SQCQP Method for Multiobjective Optimization Problems ⋮ Extension of Zoutendijk method for solving constrained multiobjective optimization problems ⋮ Conditional gradient method for multiobjective optimization ⋮ Nonlinear Conjugate Gradient Methods for Vector Optimization ⋮ On \(q\)-Newton's method for unconstrained multiobjective optimization problems ⋮ A sequential quadratic programming method for constrained multi-objective optimization problems ⋮ A Newton method for capturing Pareto optimal solutions of fuzzy multiobjective optimization problems ⋮ Globally convergent Newton-type methods for multiobjective optimization ⋮ Adaptive trust region scheme for multi-objective optimization problem using Geršgorin circle theorem ⋮ A superlinearly convergent nonmonotone quasi-Newton method for unconstrained multiobjective optimization
Cites Work
- Unnamed Item
- On improving normal boundary intersection method for generation of Pareto frontier
- Quasi-Newton methods for solving multiobjective optimization
- Scalarizations for adaptively solving multi-objective optimization problems
- Generating \(\varepsilon\)-efficient solutions in multiobjective programming
- Steepest descent methods for multicriteria optimization.
- A steepest descent method for vector optimization
- A projected gradient method for vector optimization problems
- Quasi-Newton's method for multiobjective optimization
- 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
- Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization
- Trust region methods for solving multiobjective optimisation
- A new scalarization and numerical method for constructing the weak Pareto front of multi-objective optimization problems
- Steepest descent methods for critical points in vector optimization problems
- An Overview of Techniques for Solving Multiobjective Mathematical Programs
- Newton's Method for Multiobjective Optimization
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
- ε-approximate solutions in multiobjective optimization
- Full convergence of the steepest descent method with inexact line searches
- Proximal Methods in Vector Optimization
- Scalarizing Functions for Generating the Weakly Efficient Solution Set in Convex Multiobjective Problems
This page was built for publication: A modified Quasi-Newton method for vector optimization problem
