An infeasibility certificate for nonlinear programming based on Pareto criticality condition

DOI10.1016/j.orl.2016.02.009zbMath1408.90275OpenAlexW2285389560MaRDI QIDQ1790183

Shakoor Muhammad, Vitor N. Coelho, Ricardo H. C. Takahashi, Frederico Gadelha Guimarães

Publication date: 2 October 2018

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2016.02.009

zbMATH Keywords

nonlinear programmingPareto-optimalityinfeasibility certificate

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)

Related Items (1)

Multiobjective optimization with least constraint violation: optimality conditions and exact penalization

Uses Software

• Matlab

Cites Work

• Unnamed Item
• Unnamed Item
• An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints
• Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming
• Augmented Lagrangian methods for nonlinear programming with possible infeasibility
• Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
• On a homogeneous algorithm for the monotone complementarity problem
• Certificates of linear mixed integer infeasibility
• On Primal and Dual Infeasibility Certificates in a Homogeneous Model for Convex Optimization
• Lectures on Modern Convex Optimization
• An interior point method for nonlinear programming with infeasibility detection capabilities
• Infeasibility Detection and SQP Methods for Nonlinear Optimization

This page was built for publication: An infeasibility certificate for nonlinear programming based on Pareto criticality condition