• Home
  • Search
  • An algorithm for separable piecewise convex programming problems
  • Cite Icon5
  • https://doi.org/10.1002/nav.3800200213Copy DOI Icon

An algorithm for separable piecewise convex programming problems

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

Abstract We present a branch and bound algorithm to solve mathematical programming problems of the form: Find x =|(x1,…xn) to minimize Σϕi0(x1) subject to xϵG, l≦x≦L and Σϕi0(x1)≦0, j=1,…,m. With l=(l1,…,ln) and L=(L1,…,Ln), each ϕij is assumed to be lower aemicontinuous and piecewise convex on the finite interval [li.Li]. G is assumed to be a closed convex set. The algorithm solves a finite sequence of convex programming problems; these correspond to successive partitions of the set C={x|l ≦ x ≦L} on the bahis of the piecewise convexity of the problem functions ϕij. Computational considerations are discussed, and an illustrative example is presented.

Similar Papers
  • 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
  • Citations241

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

  • Oct 01, 1992
  • Computational Optimization and Applications
  • Masao Fukushima
  • Research Article
  • Citations1

Converting general nonlinear programming problems into separable programming problems with feedforward neural networks

  • Feb 25, 2003
  • Neural Networks
  • B Lu
  • 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
  • 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
  • Citations8

A separable integer programming problem equivalent to its continual version

  • Sep 01, 1981
  • Journal of Computational and Applied Mathematics
  • A Galperin +1
  • Research Article

Machine Learning for Multi Objective Convex Separable Programming (MOCSP) with Aggregation of Linear Approximations and Portfolio Optimization

  • Mar 01, 2026
  • Foundations of Computing and Decision Sciences
  • Israr Khan +3
  • Research Article
  • Citations15

Linear, Integer, Separable and Fuzzy Programming Problems: A Unified Approach towards Reformulation

  • Feb 01, 1988
  • Journal of the Operational Research Society
  • K Darby-Dowman +3
  • Research Article
  • Citations11

Methods for job configuration in semiconductor manufacturing

  • Jan 01, 1996
  • IEEE Transactions on Semiconductor Manufacturing
  • D.P Connors +1
  • Book Chapter

Special Linear Fractional Programming Problems

  • Jan 01, 1997
  • I. M. Stancu-Minasian
  • Research Article
  • Citations2

A method for determining optimal multipliers in the surrogate constraint method

  • Jan 01, 2005
  • Electronics and Communications in Japan (Part III: Fundamental Electronic Science)
  • Yuji Nakagawa +3
  • Research Article
  • Citations98

Scheduling flexible flow shops with sequence-dependent setup effects

  • Jan 01, 2000
  • IEEE Transactions on Robotics and Automation
  • Chung-Yang Liu +1
  • Research Article
  • Citations1

Analysis of a Joint Pricing and Seat Allocation Model in a Hub-to-Hub Airline Network

  • Apr 02, 2016
  • Journal of the Operations Research Society of China
  • Hong-Zhi He
  • Research Article
  • Citations8

Symmetric duality for multiplicatively separable fractional mixed integer programming problem

  • Jan 01, 1996
  • Optimization
  • S Chandra +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.