Computable error bounds for nonlinear programming

DOI10.1007/BF01580124zbMATH Open0274.90052OpenAlexW2035442177MaRDI QIDQ5183288FDOQ5183288

Authors: 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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On Solving Systems of Equations Using Interval Arithmetic
• Title not available (Why is that?)
• The algorithmic language Triplex-ALGOL 60

Cited In (11)

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

Uses Software

• ALGOL 60

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

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