Results 31 to 40 of about 68 (67)
Disentangling orthogonal matrices. [PDF]
Linear Algebra Appl, 2017 Zhang T, Singer A.
europepmc +1 more source
A computational study of exact subgraph based SDP bounds for Max-Cut, stable set and coloring. [PDF]
Math Program, 2020 Gaar E, Rendl F.
europepmc +1 more source
Exploiting Group Symmetry in Truss Topology Optimization
AMS classification: 90C22, 20Cxx, 70-08truss topology optimization;semidefinite programming;group ...
Klerk, E. de +3 more
core
On the Convergence Analysis of the Optimized Gradient Method. [PDF]
J Optim Theory Appl, 2017 Kim D, Fessler JA.
europepmc +1 more source
Questionnaire about the risk of growth suppression of inhaled corticosteroids. [PDF]
BMJ Paediatr Open, 2019 Wolthers OD.
europepmc +1 more source
We consider semidefinite programming relaxations of the quadratic assignment problem, and show how to exploit group symmetry in the problem data. Thus we are able to compute the best known lower bounds for several instances of quadratic assignment ...
Klerk, E. de, Sotirov, R.
core
Semidefinite bounds for nonbinary codes based on quadruples. [PDF]
Des Codes Cryptogr, 2017 Litjens B, Polak S, Schrijver A.
europepmc +1 more source
AN INTERIOR POINT APPROACH FOR SEMIDEFINITE OPTIMIZATION USING NEW PROXIMITY FUNCTIONS
Kernel functions play an important role in interior point methods (IPMs) for solving linear optimization (LO) problems to define a new search direction.
M. REZA PEYGHAMI
core
A globally convergent QP-free algorithm for nonlinear semidefinite programming. [PDF]
J Inequal Appl, 2017 Li JL, Yang ZP, Jian JB.
europepmc +1 more source
Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization. [PDF]
Math Program, 2018 Gribling S, de Laat D, Laurent M.
europepmc +1 more source