Pages that link to "Item:Q1106102"
From MaRDI portal
The following pages link to Computable bounds on parametric solutions of convex problems (Q1106102):
Displaying 11 items.
- Global multi-parametric optimal value bounds and solution estimates for separable parametric programs (Q804476) (← links)
- Global optimization of multi-parametric MILP problems (Q842719) (← links)
- An algorithm for approximate multiparametric convex programming (Q853676) (← links)
- A certified natural-norm successive constraint method for parametric inf-sup lower bounds (Q891690) (← links)
- Characterizing optimality in mathematical programming models (Q1108200) (← links)
- Variable target value subgradient method (Q1174455) (← links)
- A rigorous lower bound for the optimal value of convex optimization problems (Q1424965) (← links)
- Computable error bounds for an optimization problem with parallelepiped constraint (Q1899951) (← links)
- On parametric nonlinear programming (Q2276886) (← links)
- Suggested research topics in sensitivity and stability analysis for semi- infinite programming problems (Q2276890) (← links)
- Sensitivity and stability analysis for nonlinear programming (Q2639776) (← links)