A two-segment approximation algorithm for separable convex programming with linear constraints

DOI10.1080/02331938608843114zbMath0593.90067OpenAlexW2070109874MaRDI QIDQ3724100

No author found.

Publication date: 1986

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938608843114

zbMATH Keywords

linear constraintsComputational testsseparable convex programmingsequence of feasible solutionsapproximation of the objective functiontwo-segment approximation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Methods of successive quadratic programming type (90C55)

Related Items (1)

A nonliner congestion network model for planning internal movement in the Hajj

Cites Work

• Unnamed Item
• Two-Segment Separable Programming
• Convex Analysis

This page was built for publication: A two-segment approximation algorithm for separable convex programming with linear constraints