Computational aspects of two-segment separable programming

DOI10.1007/BF02591890zbMath0516.90058OpenAlexW2015142254MaRDI QIDQ3664835

Robert R. Meyer

Publication date: 1983

Published in: Mathematical Programming (Search for Journal in Brave)

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

zbMATH Keywords

error boundstest problemsnetwork optimizationcomputational comparisonspiecewise-linear approximationseparable convex programscomputation of lower boundslocal, two-segment approximationsprimal and a dual approachrecursive separable programming algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Convex programming (90C25) Deterministic network models in operations research (90B10) Methods of successive quadratic programming type (90C55)

Related Items (10)

Optimal objective function approximation for separable convex quadratic programming ⋮ Global minimization of indefinite quadratic problems ⋮ Sandwich approximation of univariate convex functions with an application to separable convex programming ⋮ Competitive facility location model with concave demand ⋮ Reduction of nonlinear integer separable programming problems^∗ ⋮ Controlled predatory pricing in a multiperiod Stackelberg game: an MPEC approach ⋮ A Polynomial-Time Descent Method for Separable Convex Optimization Problems with Linear Constraints ⋮ Computational aspects of two-segment separable programming ⋮ Cross decomposition applied to the stochastic transportation problem ⋮ The empirical performance of a polynomial algorithm for constrained nonlinear optimization

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

This page was built for publication: Computational aspects of two-segment separable programming