A polynomial-time descent method for separable convex optimization problems with linear constraints
From MaRDI portal
Recommendations
- Convex separable optimization is not much harder than linear optimization
- Convex separable minimization problems with a linear constraint and bounded variables
- Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints
- Separable convex optimization problems with linear ascending constraints
- Algorithms for separable convex optimization with linear ascending constraints
Cites work
- A linear programming approach to the chemical equilibrium problem
- A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization
- A polynomial projection algorithm for linear feasibility problems
- A strongly polynomial algorithm for linear systems having a binary solution
- An \(\varepsilon\)-relaxation method for separable convex cost generalized network flow problems
- An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence
- Complexity and algorithms for nonlinear optimization problems
- Computational aspects of two-segment separable programming
- Convex separable optimization is not much harder than linear optimization
- Inverse Optimization
- Negative-cycle detection algorithms
- Optimal objective function approximation for separable convex quadratic programming
- Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications
- Recent advances in linear programming
- Solving integer minimum cost flows with separable convex cost objective polynomially
- Solving the convex cost integer dual network flow problem
- Updating the Inverse of a Matrix
Cited in
(14)- Two algorithms for maximizing a separable concave function over a polymatroid feasible region
- Algorithms for separable convex optimization with linear ascending constraints
- An interior point parameterized central path following algorithm for linearly constrained convex programming
- Combinatorial \(n\)-fold integer programming and applications
- Preemptive scheduling for approximate computing on heterogeneous machines: tradeoff between weighted accuracy and makespan
- Polynomial-Time Algorithms for Linear and Convex Optimization on Jump Systems
- Separable convex optimization problems with linear ascending constraints
- Using separation algorithms in fixed dimension
- scientific article; zbMATH DE number 910862 (Why is no real title available?)
- Method of alternating contractions and its applications to some convex optimization problems
- On computing centroids according to the p-norms of Hamming distance vectors
- Convex separable optimization is not much harder than linear optimization
- Randomized Synthesis for Diversity and Cost Constraints with Control Improvisation
- Separable convex mixed-integer optimization: improved algorithms and lower bounds
This page was built for publication: A polynomial-time descent method for separable convex optimization problems with linear constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802141)
