Trust region methods for solving multiobjective optimisation
From MaRDI portal
Publication:2867408
DOI10.1080/10556788.2012.660483zbMath1278.90365OpenAlexW2007294066MaRDI QIDQ2867408
Mark Goh, Bing Liang, Shao-Jian Qu
Publication date: 19 December 2013
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2012.660483
Related Items (19)
Barzilai and Borwein's method for multiobjective optimization problems ⋮ A modified Quasi-Newton method for vector optimization problem ⋮ Trust region globalization strategy for the nonconvex unconstrained multiobjective optimization problem ⋮ A sequential quadratically constrained quadratic programming technique for a multi-objective optimization problem ⋮ Strong and weak conditions of regularity and optimality ⋮ The multiobjective steepest descent direction is not Lipschitz continuous, but is Hölder continuous ⋮ A trust region method for solving multicriteria optimization problems on Riemannian manifolds ⋮ Complexity bound of trust-region methods for convex smooth unconstrained multiobjective optimization ⋮ Convergence rates of the stochastic alternating algorithm for bi-objective optimization ⋮ A trust-region approach for computing Pareto fronts in multiobjective optimization ⋮ A cutting-plane method to nonsmooth multiobjective optimization problems ⋮ Quasi-Newton methods for multiobjective optimization problems ⋮ A Globally Convergent SQCQP Method for Multiobjective Optimization Problems ⋮ Extension of Zoutendijk method for solving constrained multiobjective optimization problems ⋮ Nonsmooth multiobjective programming with quasi-Newton methods ⋮ Constraint qualifications for Karush-Kuhn-Tucker conditions in multiobjective optimization ⋮ Proximal point algorithms for vector DC programming with applications to probabilistic lot sizing with service levels ⋮ Multi-criteria optimization in regression ⋮ Adaptive trust region scheme for multi-objective optimization problem using Geršgorin circle theorem
Cites Work
- Unnamed Item
- Quasi-Newton methods for solving multiobjective optimization
- Multicriteria optimization with a multiobjective golden section line search
- A survey of generalized goal programming (1970-1982)
- A trust region algorithm for minimization of locally Lipschitzian functions
- Steepest descent methods for multicriteria optimization.
- A steepest descent method for vector optimization
- A nonsmooth version of Newton's method
- Sequential Approximate Multiobjective Optimization Using Computational Intelligence
- Newton's Method for Multiobjective Optimization
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
- An Efficient Interior-Point Method for Convex Multicriteria Optimization Problems
This page was built for publication: Trust region methods for solving multiobjective optimisation
