Computable bounds on parametric solutions of convex problems
For the parametric convex problem \(\min_{x}f(x,\epsilon)\), such that \(x\in R(\epsilon)\), where \(R(\epsilon)=\{x\in E^ n;\) \(g_ i(x,\epsilon)\geq 0\), \(i=1,...,m\), \(h_ j(x,\epsilon)=0\), \(j=1,...,p\}\), \(\epsilon\in E^ r\) is the vector of parameters, \(f: E^ n\times E^ r\to E^ 1\) is \(C^ 2\) and convex in \((x,\epsilon)\), \(g_ i: E^ n\times E^ r\to E^ 1\) are \(C^ 2\) and concave in \((x,\epsilon)\) and \(h_ j: E^ n\times E^ r\to E^ 1\) are affine in \((x,\epsilon)\), the authors obtain computable upper and lower bounds on the optimal solution.
- An Application of Error Bounds for Convex Programming in a Linear Space
- Computable error bounds for nonlinear programming
- Generalized equations and their solutions, Part I: Basic theory
- Global optimization using interval analysis - the multi-dimensional case
- Global optimization with data perturbations
- Inequalities for Stochastic Nonlinear Programming Problems
- Introduction to sensitivity and stability analysis in nonlinear programming
- Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
- Rates of Stability in Nonlinear Programming
- Stability of the solution of definite quadratic programs
- Strongly Regular Generalized Equations
- Characterizing optimality in mathematical programming models
- Variable target value subgradient method
- A rigorous lower bound for the optimal value of convex optimization problems
- Computable error bounds for an optimization problem with parallelepiped constraint
- On parametric nonlinear programming
- Suggested research topics in sensitivity and stability analysis for semi- infinite programming problems
- Sensitivity and stability analysis for nonlinear programming
- scientific article; zbMATH DE number 3898632 (Why is no real title available?)
- scientific article; zbMATH DE number 3916039 (Why is no real title available?)
- Certain parametric problems of integer convex programming and their approximate solution
- Über lösungsmengen spezieller konvexer parametrisher optimierungsaufgaben
- Optimization of the optimal value function in problems of convex parametric programming
- Global multi-parametric optimal value bounds and solution estimates for separable parametric programs
- Global optimization of multi-parametric MILP problems
- An algorithm for approximate multiparametric convex programming
- A certified natural-norm successive constraint method for parametric inf-sup lower bounds
This page was built for publication: Computable bounds on parametric solutions of convex problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1106102)
