A polynomial-time descent method for separable convex optimization problems with linear constraints
type: Item
instance of: scholarly article
zbMATH Open document ID: 1338.90299
DOI: 10.1137/14098524X
author: Sergei Chubanov
published in: SIAM Journal on Optimization
publication date: 2016-04-25T00:00:00Z
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 6573172
zbMATH Keywords: convex optimization
zbMATH Keywords: separable convex function
zbMATH Keywords: polynomial algorithm
MaRDI profile type: Publication
cites work: Inverse Optimization
cites work: Solving the Convex Cost Integer Dual Network Flow Problem
cites work: Negative-cycle detection algorithms
cites work: A strongly polynomial algorithm for linear systems having a binary solution
cites work: A polynomial projection algorithm for linear feasibility problems
cites work: Recent advances in linear programming
cites work: A linear programming approach to the chemical equilibrium problem
cites work: Updating the Inverse of a Matrix
cites work: Complexity and algorithms for nonlinear optimization problems
cites work: Convex separable optimization is not much harder than linear optimization
cites work: A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization
cites work: Optimal objective function approximation for separable convex quadratic programming
cites work: Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications
cites work: Computational aspects of two-segment separable programming
cites work: Solving integer minimum cost flows with separable convex cost objective polynomially
cites work: An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence
cites work: An \(\varepsilon\)-relaxation method for separable convex cost generalized network flow problems
title: A polynomial-time descent method for separable convex optimization problems with linear constraints
description: scientific article; zbMATH DE number 6573172