Error analysis for convex separable programs: Bounds on optimal and dual optimal solutions

DOI10.1016/0022-247X(80)90096-7zbMath0463.65043OpenAlexW1992720281MaRDI QIDQ1153654

Lakshman S. Thakur

Publication date: 1980

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-247x(80)90096-7

zbMATH Keywords

numerical exampleserror analysisefficient solutionsensitivity measuresdual optimal solutions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30)

Related Items

Optimal objective function approximation for separable convex quadratic programming ⋮ Solving highly nonlinear convex separable programs using successive approximation ⋮ A MILP formulation for generalized geometric programming using piecewise-linear approximations ⋮ Sequence of polyhedral relaxations for nonlinear univariate functions ⋮ Sandwich approximation of univariate convex functions with an application to separable convex programming ⋮ Constrained optimization in \(L_{\infty}\)-norm: An algorithm for convex quadratic interpolation ⋮ A direct algorithm for optimal quadratic splines

Cites Work

• Successive approximation in separable programming: An improved procedure for convex separable programs
• Stability Theory for Systems of Inequalities. Part I: Linear Systems
• Objective function approximations in mathematical programming
• Error Analysis for Convex Separable Programs: The Piecewise Linear Approximation and The Bounds on The Optimal Objective Value
• Branch and Bound Methods for Mathematical Programming Systems
• Programming Under Uncertainty: The Equivalent Convex Program
• Deterministic Solutions for a Class of Chance-Constrained Programming Problems
• The Variable Reduction Method for Nonlinear Programming
• On Perturbations in Systems of Linear Inequalities
• Unnamed Item
• Unnamed Item
• Unnamed Item