Global optimization of truss topology with discrete bar areas. I: Theory of relaxed problems (Q953214): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10589-007-9138-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2091339908 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56050738 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4363142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple-load truss topology and sizing optimization: Some properties of minimax compliance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of truss topology with discrete bar areas. I: Theory of relaxed problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of truss topology with discrete bar areas. II: Implementation and numerical results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Truss topology optimization with discrete design variables -- guaranteed global optimality and benchmark examples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalent displacement based formulations for maximum strength truss topology design / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Method for Optimal Truss Topology Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Potential Reduction Polynomial Time Method for Truss Topology Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Truss Topology Design via Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4517110 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Modern Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hidden convexity in some nonconvex quadratically constrained quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449265 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Direct Proof of the Existence Theorem for Quadratic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerically stable methods for quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inertia-Controlling Methods for General Quadratic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterative working-set method for large-scale nonconvex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modified trajectory method for practical global optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic algorithms in truss topological optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Truss Design by Interior-Point Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4338551 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On extensions of the Frank-Wolfe theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank

Latest revision as of 20:22, 28 June 2024

scientific article
Language Label Description Also known as
English
Global optimization of truss topology with discrete bar areas. I: Theory of relaxed problems
scientific article

    Statements

    Global optimization of truss topology with discrete bar areas. I: Theory of relaxed problems (English)
    0 references
    0 references
    0 references
    17 November 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    truss topology optimization
    0 references
    global optimization
    0 references
    branch-and-bound
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references