Computable error bounds for nonlinear programming

DOI10.1007/BF01580124zbMath0274.90052OpenAlexW2035442177MaRDI QIDQ5183288

Stephen M. Robinson

Publication date: 1973

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01580124

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Related Items (11)

Computable error bounds for an optimization problem with parallelepiped constraint ⋮ An algorithm for approximate multiparametric convex programming ⋮ Computable bounds on parametric solutions of convex problems ⋮ Verification of constrained minima ⋮ Signomial dual Kuhn-Tucker intervals ⋮ What can interval analysis do for global optimization? ⋮ Efficient interval partitioning for constrained global optimization ⋮ Bounds for Lagrange multipliers and optimal points ⋮ Nonlinear equations and optimization ⋮ Interval analytic treatment of convex programming problems ⋮ Characterization of perturbed mathematical programs and interval analysis

Uses Software

• ALGOL 60

Cites Work

• The algorithmic language Triplex-ALGOL 60
• On Solving Systems of Equations Using Interval Arithmetic
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computable error bounds for nonlinear programming