A sequential quadratically constrained quadratic programming technique for a multi-objective optimization problem
From MaRDI portal
Publication:5058916
DOI10.1080/0305215X.2018.1437154OpenAlexW2792284751MaRDI QIDQ5058916
Md Abu Talhamainuddin Ansary, Geetanjali Panda
Publication date: 23 December 2022
Published in: Engineering Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/0305215x.2018.1437154
Related Items (7)
On \(q\)-steepest descent method for unconstrained multiobjective optimization problems ⋮ A concave optimization-based approach for sparse multiobjective programming ⋮ Newton’s method for uncertain multiobjective optimization problems under finite uncertainty sets ⋮ A Newton-type proximal gradient method for nonlinear multi-objective optimization problems ⋮ A Globally Convergent SQCQP Method for Multiobjective Optimization Problems ⋮ A sequential quadratic programming method for constrained multi-objective optimization problems ⋮ Adaptive trust region scheme for multi-objective optimization problem using Geršgorin circle theorem
Uses Software
Cites Work
- ASMO
- Quasi-Newton methods for solving multiobjective optimization
- A working set SQCQP algorithm with simple nonmonotone penalty parameters
- Regularity conditions in differentiable vector optimization revisited
- Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions
- Nonlinear multiobjective optimization
- Constrained qualifications in multiobjective optimization problems: Differentiable case
- Steepest descent methods for multicriteria optimization.
- A steepest descent method for vector optimization
- Quasi-Newton's method for multiobjective optimization
- A Method for Constrained Multiobjective Optimization Based on SQP Techniques
- Trust region methods for solving multiobjective optimisation
- Object Library of Algorithms for Dynamic Optimization Problems: Benchmarking SQP and Nonlinear Interior Point Methods
- Direct Multisearch for Multiobjective Optimization
- Bi-objective optimisation with multiple decision-makers: a convex approach to attain majority solutions
- A modified Quasi-Newton method for vector optimization problem
- Newton's Method for Multiobjective Optimization
- An Adaptive Scalarization Method in Multiobjective Optimization
- Some methods of solving convex programming problems
- Algorithm 695
- A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization
- A Revised Modified Cholesky Factorization Algorithm
- A Superlinearly Convergent Sequential Quadratically Constrained Quadratic Programming Algorithm for Degenerate Nonlinear Programming
- A Note on Performance Profiles for Benchmarking Software
- Multicriteria Optimization
- On the Sequential Quadratically Constrained Quadratic Programming Methods
This page was built for publication: A sequential quadratically constrained quadratic programming technique for a multi-objective optimization problem
