Convex programming with single separable constraint and bounded variables (Q885824): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: A limited-memory multipoint symmetric secant method for bound constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ellipsoidal approach to box-constrained quadratic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352739 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A shifted-barrier primal-dual algorithm model for linearly constrained optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex quadratic programming with one constraint and bounded variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A block active set algorithm for large-scale quadratic programming with box constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomially bounded algorithm for a singly constrained quadratic program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Allocation of Effort Resources among Competing Activities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4101610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3815867 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A non-interior path following method for convex quadratic programming problems with bound constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4444573 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex separable minimization subject to bounded variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4831691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for nonconvex quadratic programs with box constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4456192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4719195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Ranking Methods for Allocation of One Resource / rank
 
Normal rank

Revision as of 09:06, 26 June 2024

scientific article
Language Label Description Also known as
English
Convex programming with single separable constraint and bounded variables
scientific article

    Statements

    Convex programming with single separable constraint and bounded variables (English)
    0 references
    0 references
    0 references
    0 references
    14 June 2007
    0 references
    convex programming
    0 references
    separable programming
    0 references
    singly constrained program
    0 references
    iterative procedure
    0 references

    Identifiers