A Globally Convergent SQCQP Method for Multiobjective Optimization Problems

DOI10.1137/18M1182152zbMath1458.90567OpenAlexW3120891614MaRDI QIDQ5148405

Md Abu Talhamainuddin Ansary, Geetanjali Panda

Publication date: 4 February 2021

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/18m1182152

zbMATH Keywords

multiobjective optimizationPareto frontMangasarian-Fromovitz constraint qualificationSQCQP method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Nonlinear programming (90C30)

Related Items (6)

Using first-order information in direct multisearch for multiobjective optimization ⋮ Multiobjective optimization with least constraint violation: optimality conditions and exact penalization ⋮ Newton’s method for uncertain multiobjective optimization problems under finite uncertainty sets ⋮ A symmetric splitting sequential quadratic optimization algorithm for two-block nonlinearly constrained nonconvex optimization ⋮ A Newton-type proximal gradient method for nonlinear multi-objective optimization problems ⋮ A trust-region approach for computing Pareto fronts in multiobjective optimization

Cites Work

• 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
• The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
• A Method for Constrained Multiobjective Optimization Based on SQP Techniques
• Trust region methods for solving multiobjective optimisation
• Direct Multisearch for Multiobjective Optimization
• A modified Quasi-Newton method for vector optimization problem
• Newton's Method for Multiobjective Optimization
• Some methods of solving convex programming problems
• A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization
• A Superlinearly Convergent Sequential Quadratically Constrained Quadratic Programming Algorithm for Degenerate Nonlinear Programming
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• A sequential quadratically constrained quadratic programming technique for a multi-objective optimization problem
• Benchmarking Derivative-Free Optimization Algorithms
• A Note on Performance Profiles for Benchmarking Software
• Multicriteria Optimization
• On the Sequential Quadratically Constrained Quadratic Programming Methods
• Unnamed Item

This page was built for publication: A Globally Convergent SQCQP Method for Multiobjective Optimization Problems