Pages that link to "Item:Q5183288"
From MaRDI portal
The following pages link to Computable error bounds for nonlinear programming (Q5183288):
Displaying 11 items.
- An algorithm for approximate multiparametric convex programming (Q853676) (← links)
- Efficient interval partitioning for constrained global optimization (Q956597) (← links)
- Computable bounds on parametric solutions of convex problems (Q1106102) (← links)
- Signomial dual Kuhn-Tucker intervals (Q1134014) (← links)
- What can interval analysis do for global optimization? (Q1186266) (← links)
- Interval analytic treatment of convex programming problems (Q1259409) (← links)
- Characterization of perturbed mathematical programs and interval analysis (Q1315426) (← links)
- Bounds for Lagrange multipliers and optimal points (Q1802498) (← links)
- Nonlinear equations and optimization (Q1802504) (← links)
- Computable error bounds for an optimization problem with parallelepiped constraint (Q1899951) (← links)
- Verification of constrained minima (Q1919423) (← links)