• Home
  • Search
  • Convex programming with single separable constraint and bounded variables
  • Cite Icon8
  • https://doi.org/10.1007/s10589-006-0396-4Copy DOI Icon

Convex programming with single separable constraint and bounded variables

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

In this paper a minimization problem with convex objective function subject to a separable convex inequality constraint "?" and bounded variables (box constraints) is considered. We propose an iterative algorithm for solving this problem based on line search and convergence of this algorithm is proved. At each iteration, a separable convex programming problem with the same constraint set is solved using Karush-Kuhn-Tucker conditions. Convex minimization problems subject to linear equality/ linear inequality "?" constraint and bounds on the variables are also considered. Numerical illustration is included in support of theory.

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
  • Citations5

An algorithm for separable piecewise convex programming problems

  • Jun 01, 1973
  • Naval Research Logistics Quarterly
  • Richard M Soland
  • 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
  • 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
  • Citations4

Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints

  • Oct 01, 2009
  • Journal of Interdisciplinary Mathematics
  • Stefan M Stefanov
  • 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
  • Citations93

Generalized symmetric ADMM for separable convex optimization

  • Nov 24, 2017
  • Computational Optimization and Applications
  • Jianchao Bai +3
  • Book Chapter
  • Citations2

Optimization I: Brute Force and Greedy Strategy

  • Apr 01, 2019
  • Sandeep Sen +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
  • Citations39

Manifold Optimization Over the Set of Doubly Stochastic Matrices: A Second-Order Geometry

  • Feb 07, 2018
  • IEEE Transactions on Signal Processing
  • Ahmed Douik +1
  • 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
  • Citations34

Convex Quadratic Minimization Subject to a Linear Constraint and Box Constraints

  • Jan 01, 2004
  • Applied Mathematics Research eXpress
  • Stefan Stefanov
  • Research Article
  • Citations22

Computational aspects of two-segment separable programming

  • May 01, 1983
  • Mathematical Programming
  • R R Meyer
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.