A global optimization using linear relaxation for generalized geometric programming (Q2427180): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Shao-Jian Qu / rank
 
Normal rank
Property / author
 
Property / author: Ke-Cun Zhang / rank
 
Normal rank
Property / author
 
Property / author: Fu-Sheng Wang / 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.ejor.2007.06.034 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2047939651 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126238621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4833806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Programming: Methods, Computations and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized geometric programming applied to problems of optimal control. I: Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The expansion of functions under transformation and its application to optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction of indefinite quadratic programs to bilinear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4113605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Weighted Mean Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Polynomial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An infeasible interior-point algorithm for solving primal and dual geometric programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reformulation-convexification approach for solving nonconvex quadratic programming problems / 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: Global optimization of nonconvex polynomial programming problems having rational exponents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of signomial geometric programming using linear relaxation. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of generalized geometric programming algorithms / rank
 
Normal rank

Latest revision as of 08:37, 28 June 2024

scientific article
Language Label Description Also known as
English
A global optimization using linear relaxation for generalized geometric programming
scientific article

    Statements

    A global optimization using linear relaxation for generalized geometric programming (English)
    0 references
    8 May 2008
    0 references
    generalized geometric programming
    0 references
    global optimization
    0 references
    linear relaxation
    0 references
    branch and bound
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers