A sequential quadratically constrained quadratic programming technique for a multi-objective optimization problem
From MaRDI portal
Recommendations
- A Globally Convergent SQCQP Method for Multiobjective Optimization Problems
- A sequential quadratic programming method for constrained multi-objective optimization problems
- A method for constrained multiobjective optimization based on SQP techniques
- A new reduced gradient method for solving linearly constrained multiobjective optimization problems
- Multiple reduced gradient method for multiobjective optimization problems
Cites work
- A Revised Modified Cholesky Factorization Algorithm
- A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization
- A Superlinearly Convergent Sequential Quadratically Constrained Quadratic Programming Algorithm for Degenerate Nonlinear Programming
- A method for constrained multiobjective optimization based on SQP techniques
- A modified Quasi-Newton method for vector optimization problem
- A note on performance profiles for benchmarking software
- A steepest descent method for vector optimization
- A working set SQCQP algorithm with simple nonmonotone penalty parameters
- ASMO
- Algorithm 695
- An Adaptive Scalarization Method in Multiobjective Optimization
- Bi-objective optimisation with multiple decision-makers: a convex approach to attain majority solutions
- Constrained qualifications in multiobjective optimization problems: Differentiable case
- Direct Multisearch for Multiobjective Optimization
- Multicriteria Optimization
- Newton's method for multiobjective optimization
- Nonlinear multiobjective optimization
- Object library of algorithms for dynamic optimization problems: benchmarking SQP and nonlinear interior point methods
- On the Sequential Quadratically Constrained Quadratic Programming Methods
- Quasi-Newton methods for solving multiobjective optimization
- Quasi-Newton's method for multiobjective optimization
- Regularity conditions in differentiable vector optimization revisited
- Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions
- Some methods of solving convex programming problems
- Steepest descent methods for multicriteria optimization.
- Trust region methods for solving multiobjective optimisation
Cited in
(16)- A trust region technique for multiobjective optimization problems with equality and inequality constraints
- On q-steepest descent method for unconstrained multiobjective optimization problems
- A reduced Jacobian method with full convergence property
- A trust-region scheme for constrained multi-objective optimization problems with superlinear convergence property
- A line search technique for a class of multi-objective optimization problems using subgradient
- A method for constrained multiobjective optimization based on SQP techniques
- Some composite-step constrained optimization methods interpreted via the perturbed sequential quadratic programming framework
- A Newton-type proximal gradient method for nonlinear multi-objective optimization problems
- A sequential quadratic programming method for constrained multi-objective optimization problems
- Newton’s method for uncertain multiobjective optimization problems under finite uncertainty sets
- A concave optimization-based approach for sparse multiobjective programming
- Adaptive trust region scheme for multi-objective optimization problem using Geršgorin circle theorem
- A Globally Convergent SQCQP Method for Multiobjective Optimization Problems
- Inexact exponential penalty function with the augmented Lagrangian for multiobjective optimization algorithms
- On conjugate direction-type method for interval-valued multiobjective quadratic optimization problems
- Steepest descent method for uncertain multiobjective optimization problems under finite uncertainty set
This page was built for publication: A sequential quadratically constrained quadratic programming technique for a multi-objective optimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5058916)
