A new accelerating method for globally solving a class of nonconvex programming problems (Q923946): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Pei-Ping Shen / rank
Normal rank
 
Property / author
 
Property / author: Pei-Ping Shen / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.na.2009.01.142 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2090518645 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for globally solving a class of nonconvex programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5630793 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving long-term financial planning problems via global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352213 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Optimization of Large-Scale Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified monotonic approach to generalized linear fractional programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm to globally solve the sum of several linear ratios / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of generalized linear fractional programming with nonlinear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An outcome-space finite algorithm for solving linear multiplicative programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of multiplicative programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite algorithm for generalized linear multiplicative programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new rectangle branch-and-pruning approach for generalized geometric programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic global optimization algorithm for generalized geometric programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prediction of oligopeptide conformations via deterministic global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearization method for a class of multiplicative programming with exponent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis and global optimization / rank
 
Normal rank

Revision as of 19:39, 1 July 2024

scientific article
Language Label Description Also known as
English
A new accelerating method for globally solving a class of nonconvex programming problems
scientific article

    Statements

    A new accelerating method for globally solving a class of nonconvex programming problems (English)
    0 references
    0 references
    0 references
    0 references
    24 July 2009
    0 references
    deleting technique
    0 references
    branch and bound
    0 references

    Identifiers