Certificates of infeasibility via nonsmooth optimization

DOI10.1007/S10898-016-0473-XMaRDI QIDQ1675645zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Hannes Fendl, Arnold Neumaier, Hermann Schichl

Publication date 2 November 2017

Published in Journal of Global Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1506.08338

zbMATH Keywords

global optimizationnonsmooth optimizationcertificate of infeasibility

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56)

Abstract: An important aspect in the solution process of constraint satisfaction problems is to identify exclusion boxes which are boxes that do not contain feasible points. This paper presents a certificate of infeasibility for finding such boxes by solving a linearly constrained nonsmooth optimization problem. Furthermore, the constructed certificate can be used to enlarge an exclusion box by solving a nonlinearly constrained nonsmooth optimization problem.

Recommendations

• An infeasibility certificate for nonlinear programming based on Pareto criticality condition
• Certificates of linear mixed integer infeasibility
• Rigorous verification of feasibility
• Exclusion regions for optimization problems
• Feasibility and infeasibility in optimization. Algorithms and computational methods.

Cites work

• scientific article; zbMATH DE number 1595639 (Why is no real title available?)
• scientific article; zbMATH DE number 3118785 (Why is no real title available?)
• scientific article; zbMATH DE number 3880009 (Why is no real title available?)
• scientific article; zbMATH DE number 53680 (Why is no real title available?)
• scientific article; zbMATH DE number 54095 (Why is no real title available?)
• scientific article; zbMATH DE number 976325 (Why is no real title available?)
• scientific article; zbMATH DE number 1440908 (Why is no real title available?)
• scientific article; zbMATH DE number 7374771 (Why is no real title available?)
• scientific article; zbMATH DE number 3281218 (Why is no real title available?)
• scientific article; zbMATH DE number 3281219 (Why is no real title available?)
• A bundle-Newton method for nonsmooth unconstrained minimization
• An implementation of Shor's \(r\)-algorithm
• BARON: A general purpose global optimization software package
• Certificates of infeasibility via nonsmooth optimization
• Complete search in continuous global optimization and constraint satisfaction
• G<scp>LOPT</scp>L<scp>AB</scp>: a configurable framework for the rigorous global solution of quadratic constraint satisfaction problems
• Interval Methods for Systems of Equations
• Interval arithmetic: from principles to implementation
• Numerical Software with Result Verification
• On implementing a primal-dual interior-point method for conic quadratic optimization
• On the implementation and usage of SDPT3 -- a Matlab software package for semidefinite-quadratic-linear programming, version 4.0
• Rigorous global search: continuous problems

Cited in

(5)

• Certificates of linear mixed integer infeasibility
• An infeasibility certificate for nonlinear programming based on Pareto criticality condition
• Certificates of infeasibility via nonsmooth optimization
• On primal and dual infeasibility certificates in a homogeneous model for convex optimization
• Rigorous verification of feasibility

Describes a project that uses

Uses Software

• MPBNGC
• PNEW
• PBNCGC
• LINGO
• COCONUT
• INTOPT_90
• LINDO
• SolvOpt
• SDPT3
• lp_solve
• INTLAB
• SeDuMi
• SOCP
• GLOPTLAB
• BARON

This page was built for publication: Certificates of infeasibility via nonsmooth optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1675645)