A Polynomial-Time Descent Method for Separable Convex Optimization Problems with Linear Constraints (Q2802141): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Inverse Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Convex Cost Integer Dual Network Flow Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Negative-cycle detection algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly polynomial algorithm for linear systems having a binary solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial projection algorithm for linear feasibility problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent Advances in Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Programming Approach to the Chemical Equilibrium Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Updating the Inverse of a Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and algorithms for nonlinear optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex separable optimization is not much harder than linear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal objective function approximation for separable convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational aspects of two-segment separable programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving integer minimum cost flows with separable convex cost objective polynomially / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(\varepsilon\)-relaxation method for separable convex cost generalized network flow problems / rank
 
Normal rank

Latest revision as of 20:17, 11 July 2024

scientific article
Language Label Description Also known as
English
A Polynomial-Time Descent Method for Separable Convex Optimization Problems with Linear Constraints
scientific article

    Statements

    A Polynomial-Time Descent Method for Separable Convex Optimization Problems with Linear Constraints (English)
    0 references
    0 references
    25 April 2016
    0 references
    convex optimization
    0 references
    separable convex function
    0 references
    polynomial algorithm
    0 references

    Identifiers