Group symmetry in interior-point methods for semidefinite program
From MaRDI portal
Publication:1863859
DOI10.1023/A:1015366416311zbMath1035.90056OpenAlexW5452359MaRDI QIDQ1863859
Makoto Ohsaki, Yoshihiro Kanno, Kazuo Murota, Naoki Katoh
Publication date: 12 March 2003
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1015366416311
structural optimizationsemidefinite programprimal-dual interior-point methodgroup representation theory
Related Items
Symmetry groups, semidefinite programs, and sums of squares, Symmetry in Mathematical Programming, Generic Symmetry-Forced Infinitesimal Rigidity: Translations and Rotations, Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation, Non-uniqueness and symmetry of optimal topology of a shell for minimum compliance, Exploring new tensegrity structures via mixed integer programming, Automorphisms of Rank-One Generated Hyperbolicity Cones and Their Derivative Relaxations, Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs, A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming, A variance-expected compliance model for structural optimization, Characterizing the universal rigidity of generic tensegrities, Simultaneous singular value decomposition, Symmetric sums of squares over \(k\)-subset hypercubes, Group symmetry and covariance regularization, Structured semidefinite programs for the control of symmetric systems, Group theoretic approach to large-deformation property of three-dimensional bar-hinge mechanism, Symmetry in semidefinite programs, Reduction of truss topology optimization, Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming, Invariant Semidefinite Programs, Exploiting group symmetry in truss topology optimization, Exploiting special structure in semidefinite programming: a survey of theory and applications, Symmetry Reduction to Optimize a Graph-based Polynomial From Queueing Theory, Gain-sparsity and symmetry-forced rigidity in the plane
Uses Software
