• Home
  • Search
  • Computational aspects of two-segment separable programming
  • Open Access IconOpen Access
  • Cite Icon22
  • https://doi.org/10.1007/bf02591890Copy DOI Icon

Computational aspects of two-segment separable programming

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Recursive separable programming algorithms based on local, two-segment approximations are described for the solution of separable convex programs. Details are also given for the computation of lower bounds on the optimal value by both a primal and a dual approach, and these approaches are compared. Computational comparisons of the methods are provided for a variety of test problems, including a water supply application (with more than 600 constraints and more than 900 variables) and an econometric modelling problem (with more than 200 variables).

Similar Papers
  • Dissertation
  • Citations3

A separable programming model incorporating linear demand functions for grains and vegetable oils: an analysis of United States agriculture in 1985

  • Oct 30, 2014
  • Shashanka Bhide
  • Research Article
  • Citations7

Explicit model of dual programming and solving method for a class of separable convex programming problems

  • Oct 26, 2018
  • Engineering Optimization
  • Yunkang Sui +1
  • Research Article
  • Citations8

Convex programming with single separable constraint and bounded variables

  • Nov 21, 2006
  • Computational Optimization and Applications
  • Kalpana Dahiya +2
  • Research Article
  • Citations5

An algorithm for separable piecewise convex programming problems

  • Jun 01, 1973
  • Naval Research Logistics Quarterly
  • Richard M Soland
  • Research Article
  • Citations11

Methods for job configuration in semiconductor manufacturing

  • Jan 01, 1996
  • IEEE Transactions on Semiconductor Manufacturing
  • D.P Connors +1
  • Research Article
  • Citations8

A proximal fully parallel splitting method with a relaxation factor for separable convex programming

  • Sep 22, 2023
  • Applied Numerical Mathematics
  • Jianghua Yin +4
  • Research Article
  • Citations93

Generalized symmetric ADMM for separable convex optimization

  • Nov 24, 2017
  • Computational Optimization and Applications
  • Jianchao Bai +3
  • Research Article
  • Citations4

The Application of Mathematical Programming to Loop Feeder Allocation

  • Apr 01, 1980
  • Bell System Technical Journal
  • T R Elken
  • Book Chapter
  • Citations2

SQP versus SCP Methods for Nonlinear Programming

  • Jan 01, 2005
  • Klaus Schittkowski +1
  • PDF
  • Research Article
  • Citations76

On the Convergence Analysis of the Alternating Direction Method of Multipliers with Three Blocks

  • Jan 01, 2013
  • Abstract and Applied Analysis
  • Caihua Chen +2
  • Research Article
  • Citations41

Linearized alternating direction method of multipliers with Gaussian back substitution for separable convex programming

  • Jan 01, 2013
  • Numerical Algebra, Control & Optimization
  • Bingsheng He +1
  • Research Article
  • Citations6

A proximal splitting method for separable convex programming and its application to compressive sensing

  • Feb 21, 2016
  • Journal of Nonlinear Sciences and Applications
  • Hongchun Sun +2
  • Conference Article

The alternating direction method of multipliers for separable convex programming problems and its application to second-order cone programming problems

  • Jan 01, 2008
  • Proceedings of the Annual Conference of the Institute of Systems, Control and Information Engineers
  • Ryota Otsubo +1
  • Research Article
  • Citations22

Convergence analysis of positive-indefinite proximal ADMM with a Glowinski’s relaxation factor

  • May 22, 2019
  • Numerical Algorithms
  • Jiawei Chen +3
  • Research Article
  • Citations241

Application of the alternating direction method of multipliers to separable convex programming problems

  • Oct 01, 1992
  • Computational Optimization and Applications
  • Masao Fukushima
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.