A sequential quadratic programming method for constrained multi-objective optimization problems
From MaRDI portal
Publication:2053082
Abstract: In this article, a globally convergent sequential quadratic programming (SQP) method is developed for multi-objective optimization problems with inequality type constraints. A feasible descent direction is obtained using a linear approximation of all objective functions as well as constraint functions. The sub-problem at every iteration of the sequence has feasible solution. A non-differentiable penalty function is used to deal with constraint violations. A descent sequence is generated which converges to a critical point under the Mangasarian-Fromovitz constraint qualification along with some other mild assumptions. The method is compared with a selection of existing methods on a suitable set of test problems.
Recommendations
- A Globally Convergent SQCQP Method for Multiobjective Optimization Problems
- A sequential quadratically constrained quadratic programming technique for a multi-objective optimization problem
- A method for constrained multiobjective optimization based on SQP techniques
- A sequential quadratically constrained quadratic programming method of feasible directions
- scientific article; zbMATH DE number 780774
Cites work
- 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 projected gradient method for vector optimization problems
- A quadratically-convergent algorithm for general nonlinear programming problems
- A Robust Algorithm for Optimization with General Equality and Inequality Constraints
- A robust sequential quadratic programming method
- A sequential quadratically constrained quadratic programming technique for a multi-objective optimization problem
- A variant of SQP method for inequality constrained optimization and its global convergence
- An Adaptive Scalarization Method in Multiobjective Optimization
- An algorithm for solving linearly constrained minimax problems
- Bi-objective optimisation with multiple decision-makers: a convex approach to attain majority solutions
- Box-constrained multi-objective optimization: A gradient-like method without ``a priori scalarization
- Constrained qualifications in multiobjective optimization problems: Differentiable case
- Convergence of the projected gradient method for quasiconvex multiobjective optimization
- Global convergence on an active set SQP for inequality constrained optimization
- scientific article; zbMATH DE number 3583207 (Why is no real title available?)
- scientific article; zbMATH DE number 1932419 (Why is no real title available?)
- Inexact projected gradient method for vector optimization
- Multiobjective optimization. Interactive and evolutionary approaches
- Multiple attribute decision making. Methods and applications. A state-of- the-art survey
- Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
- Newton's method for multiobjective optimization
- Nonlinear multiobjective optimization
- Quasi-Newton's method for multiobjective optimization
- Regularity conditions in differentiable vector optimization revisited
- Steepest descent methods for multicriteria optimization.
- Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
Cited in
(25)- A path following method for box-constrained multiobjective optimization with applications to goal programming problems
- An extended two-stage sequential optimization approach: properties and performance
- Adaptive trust region scheme for multi-objective optimization problem using Geršgorin circle theorem
- A method for constrained multiobjective optimization based on SQP techniques
- Some composite-step constrained optimization methods interpreted via the perturbed sequential quadratic programming framework
- scientific article; zbMATH DE number 6610867 (Why is no real title available?)
- Approximation Schemes for Multi-objective Optimization with Quadratic Constraints of Fixed CP-Rank
- Sequential Approximate Multiobjective Optimization Using Computational Intelligence
- scientific article; zbMATH DE number 1098939 (Why is no real title available?)
- A sequential quadratically constrained quadratic programming technique for a multi-objective optimization problem
- A Globally Convergent SQCQP Method for Multiobjective Optimization Problems
- Newton’s method for uncertain multiobjective optimization problems under finite uncertainty sets
- A constrained multiobjective differential evolution algorithm based on the fusion of two rankings
- A Newton-type proximal gradient method for nonlinear multi-objective optimization problems
- Inexact exponential penalty function with the augmented Lagrangian for multiobjective optimization algorithms
- An algorithm to solve multi-objective integer quadratic programming problem
- MultiSQP-GS: a sequential quadratic programming algorithm via gradient sampling for nonsmooth constrained multiobjective optimization
- On conjugate direction-type method for interval-valued multiobjective quadratic optimization problems
- Steepest descent method for uncertain multiobjective optimization problems under finite uncertainty set
- A reduced Jacobian method with full convergence property
- A trust-region scheme for constrained multi-objective optimization problems with superlinear convergence property
- An exact penalty method with nonmonotone line search and rapid infeasibility detection for constrained multiobjective optimization: application in supervised machine learning
- An accelerated method for solving constrained multi-objective optimization
- A nonmonotone line search method for solving constrained multiobjective optimization problems
- A tunneling method for nonlinear multi-objective optimization problems
This page was built for publication: A sequential quadratic programming method for constrained multi-objective optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2053082)
