Error Analysis for Convex Separable Programs: The Piecewise Linear Approximation and The Bounds on The Optimal Objective Value
From MaRDI portal
Publication:4158825
DOI10.1137/0134059zbMath0379.90084OpenAlexW2041463837MaRDI QIDQ4158825
Publication date: 1978
Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0134059
Related Items
A computable convex programming characterization of optimal interpolatory quadratic splines with free knots, Tractable approximate robust geometric programming, Optimal objective function approximation for separable convex quadratic programming, Solving highly nonlinear convex separable programs using successive approximation, Global minimization of indefinite quadratic problems, A MILP formulation for generalized geometric programming using piecewise-linear approximations, 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, Algorithms for a risk-averse Stackelberg game with multiple adversaries, Error analysis for convex separable programs: Bounds on optimal and dual optimal solutions, A direct algorithm for optimal quadratic splines, A completely positive representation of \(0\)-\(1\) linear programs with joint probabilistic constraints, Maximum probability shortest path problem, Chance constrained \(0-1\) quadratic programs using copulas, A parallel algorithm for partially separable non-convex global minimization: Linear constraints, An effective linear approximation method for separable programming problems, Computational aspects of two-segment separable programming, A bayesian estimator for the dependence function of a bivariate extreme‐value distribution
