• Home
  • Search
  • Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints
  • Cite Icon4
  • https://doi.org/10.1080/09720502.2009.10700652Copy DOI Icon

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

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

A minimization problem with strictly convex separable objective function subject to a convex separable inequality constraint of the form “less than or equal to” and bounds on the variables is considered. Necessary and sufficient condition is proved for a feasible solution to be an optimal solution to this problem. An iterative algorithm of polynomial complexity for solving such problems is suggested and its convergence is proved. Modifications of this algorithm are proposed in connection with some extensions of the considered problem as well as in order to avoid some computational difficulties. Examples of important convex functions for the problem under consideration and computational results are presented.

Similar Papers
  • PDF
  • Research Article
  • Citations15

Convex separable minimization problems with a linearconstraint and bounded variables

  • Jan 01, 2000
  • International Journal of Mathematics and Mathematical Sciences
  • Stefan M Stefanov
  • Research Article
  • Citations8

Convex programming with single separable constraint and bounded variables

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

The Extension of Auxiliary Problem Principle for Solving Dynamic Economic Dispatch Problem in Power Systems

  • Jan 01, 2022
  • Journal of Mathematics
  • Yaming Ren
  • Research Article
  • Citations4

Synchronous Parallel Block Coordinate Descent Method for Nonsmooth Convex Function Minimization

  • Apr 01, 2020
  • Journal of Systems Science and Complexity
  • Yutong Dai +1
  • Book Chapter
  • Citations3

Chapter 9 - Convex and concave functions

  • Jan 01, 2006
  • Mathematical Programming
  • S.M Sinha
  • Research Article
  • Citations732

On the linear convergence of the alternating direction method of multipliers

  • Jul 06, 2016
  • Mathematical Programming
  • Mingyi Hong +1
  • Research Article
  • Citations4

Optimal iterative QP and QPQC algorithms

  • Oct 11, 2013
  • Annals of Operations Research
  • Zdeněk Dostál +1
  • Research Article
  • Citations7

Algorithms for sparse and low-rank optimization: convergence, complexity and applications

  • Jan 01, 2011
  • Columbia Academic Commons (Columbia University)
  • Donald Goldfarb +1
  • PDF
  • Research Article
  • Citations3

An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems

  • Apr 27, 2018
  • Journal of Inequalities and Applications
  • Chunming Tang +2
  • PDF
  • Research Article
  • Citations74

A primal-dual fixed point algorithm for minimization of the sum of three convex separable functions

  • Apr 26, 2016
  • Fixed Point Theory and Applications
  • Peijun Chen +2
  • Conference Article
  • Citations3

Handling Box, Linear and Quadratic-Convex Constraints for Boundary Optimization with Differential Evolution Algorithms

  • Jan 01, 2009
  • Massimo Spadoni +1
  • Research Article
  • Citations2

Closure, Convexity, and Linearity in Banach Spaces

  • Oct 01, 1946
  • The Annals of Mathematics
  • William F Eberlein
  • Research Article
  • Citations142

IPiasco: Inertial Proximal Algorithm for Strongly Convex Optimization

  • Feb 19, 2015
  • Journal of Mathematical Imaging and Vision
  • Peter Ochs +2
  • Research Article

Inner γ-Convex Functions in Normed Linear Spaces

  • Feb 06, 2015
  • Vietnam Journal of Mathematics
  • Hoang Xuan Phu
  • Research Article
  • Citations56

A Polynomial Time Algorithm for the Resource Allocation Problem with a Convex Objective Function

  • May 01, 1979
  • Journal of the Operational Research Society
  • N Katoh +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.