Characterization of perturbed mathematical programs and interval analysis

DOI10.1007/BF01582158zbMath0811.90102MaRDI QIDQ1315426

Marietta J. Tretter, John J. Dinkel

Publication date: 10 March 1994

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

interval arithmeticperturbed convex programs

Mathematics Subject Classification ID

Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Interval and finite arithmetic (65G30)

Related Items (1)

Maximizing strictly convex quadratic functions with bounded perturbations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Introduction to sensitivity and stability analysis in nonlinear programming
• Global optimization with data perturbations
• Interval Newton methods and perturbed problems
• Global optimization using interval analysis - the multi-dimensional case
• Bounding Global Minima with Interval Arithmetic
• An Interval Arithmetic Approach to Sensitivity Analysis in Geometric Programming
• Bounding Global Minima
• Characterizing an optimal input in perturbed convex programming
• Computable error bounds for nonlinear programming

This page was built for publication: Characterization of perturbed mathematical programs and interval analysis