Computational aspects of two-segment separable programming
From MaRDI portal
Publication:3664835
DOI10.1007/BF02591890zbMath0516.90058MaRDI QIDQ3664835
Publication date: 1983
Published in: Mathematical Programming (Search for Journal in Brave)
error bounds; test problems; network optimization; computational comparisons; piecewise-linear approximation; separable convex programs; computation of lower bounds; local, two-segment approximations; primal and a dual approach; recursive separable programming algorithms
90C35: Programming involving graphs or networks
65K05: Numerical mathematical programming methods
90C25: Convex programming
90B10: Deterministic network models in operations research
90C55: Methods of successive quadratic programming type
Related Items
Cross decomposition applied to the stochastic transportation problem, Competitive facility location model with concave demand, Global minimization of indefinite quadratic problems, The empirical performance of a polynomial algorithm for constrained nonlinear optimization, Optimal objective function approximation for separable convex quadratic programming, Computational aspects of two-segment separable programming, Reduction of nonlinear integer separable programming problems∗, Sandwich approximation of univariate convex functions with an application to separable convex programming
Cites Work
- Unnamed Item
- Unnamed Item
- Two-Segment Separable Programming
- Computational aspects of two-segment separable programming
- Secant approximation methods for convex optimization
- On the Goldstein-Levitin-Polyak gradient projection method
- Objective function approximations in mathematical programming
- A Class of Nonlinear Integer Programs Solvable by a Single Linear Program
- Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
- Solving the Pipe Network Analysis Problem Using Optimization Techniques
- Error Analysis for Convex Separable Programs: The Piecewise Linear Approximation and The Bounds on The Optimal Objective Value
- Dualität und Approximation bei konvexen Optimierungsproblemen
- Die Methode der „direkten Koeffizientenanpassung“ (μ-Form) des Separable Programming
