Computable bounds on parametric solutions of convex problems

DOI10.1007/BF01580732MaRDI QIDQ1106102zbMATH OpenFDO

Authors Anthony V. Fiacco, Jerzy Kyparisis

Publication date 1988

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

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

zbMATH Keywords

upper and lower boundsparametric convex problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31)

Recommendations

• scientific article; zbMATH DE number 841069
• Certain parametric problems of integer convex programming and their approximate solution
• scientific article; zbMATH DE number 1736449
• scientific article; zbMATH DE number 3898632
• scientific article; zbMATH DE number 1135706

Cites work

• 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

Cited in

(15)

• Über lösungsmengen spezieller konvexer parametrisher optimierungsaufgaben
• Characterizing optimality in mathematical programming models
• Certain parametric problems of integer convex programming and their approximate solution
• On parametric nonlinear programming
• A rigorous lower bound for the optimal value of convex optimization problems
• scientific article; zbMATH DE number 3916039 (Why is no real title available?)
• Variable target value subgradient method
• Computable error bounds for an optimization problem with parallelepiped constraint
• scientific article; zbMATH DE number 3898632 (Why is no real title available?)
• Sensitivity and stability analysis for nonlinear programming
• A certified natural-norm successive constraint method for parametric inf-sup lower bounds
• Optimization of the optimal value function in problems of convex parametric programming
• Suggested research topics in sensitivity and stability analysis for semi- infinite programming problems
• Global optimization of multi-parametric MILP problems
• An algorithm for approximate multiparametric convex programming

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)