Rigorous verification of feasibility

DOI10.1007/S10898-014-0158-2MaRDI QIDQ2018466zbMATH OpenOpenAlexFDO

Authors Ferenc Domes, Arnold Neumaier

Publication date 24 March 2015

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

Full work available at URL https://doi.org/10.1007/s10898-014-0158-2

zbMATH Keywords

global optimizationconstraint satisfactioninterval analysisverified computingrigorous feasibility verification

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Recommendations

• On proving existence of feasible points in equality constrained optimization problems
• scientific article; zbMATH DE number 869737
• Certificates of infeasibility via nonsmooth optimization
• Numerical solution for bounding feasible point sets
• Verification of constrained minima

Cites work

• scientific article; zbMATH DE number 3880009 (Why is no real title available?)
• scientific article; zbMATH DE number 5775425 (Why is no real title available?)
• scientific article; zbMATH DE number 3682951 (Why is no real title available?)
• scientific article; zbMATH DE number 54095 (Why is no real title available?)
• scientific article; zbMATH DE number 524107 (Why is no real title available?)
• scientific article; zbMATH DE number 714516 (Why is no real title available?)
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• scientific article; zbMATH DE number 3281219 (Why is no real title available?)
• A scaling algorithm for polynomial constraint satisfaction problems
• Benchmarking global optimization and constraint satisfaction codes
• Constraint aggregation for rigorous global optimization
• Constraint propagation on quadratic constraints
• Derived eigenvalues of symmetric matrices, with applications to distance geometry
• Existence Verification for Singular Zeros of Complex Nonlinear Systems
• G<scp>LOPT</scp>L<scp>AB</scp>: a configurable framework for the rigorous global solution of quadratic constraint satisfaction problems
• Interval Slopes for Rational Functions and Associated Centered Forms
• On proving existence of feasible points in equality constrained optimization problems
• Rigorous filtering using linear relaxations
• Super-fast validated solution of linear systems
• The optimization test environment

Cited in

(11)

• Convergent upper bounds in global minimization with nonlinear equality constraints
• A branch and bound algorithm for quantified quadratic programming
• Numerical solution for bounding feasible point sets
• Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
• Some observations on exclusion regions in branch and bound algorithms
• Linear and parabolic relaxations for quadratic constraints
• Constraint aggregation for rigorous global optimization
• Certificates of infeasibility via nonsmooth optimization
• Some feasibility sampling procedures in interval methods for constrained global optimization
• Rigorous packing of unit squares into a circle
• Relaxed verification for continuous problems

Describes a project that uses

Uses Software

• testenv
• GLOPTLAB
• BARON

This page was built for publication: Rigorous verification of feasibility

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