Results 41 to 50 of about 91 (79)

Complete positivity and distance-avoiding sets. [PDF]

Math Program, 2022
DeCorte E, Filho FMO, Vallentin F.
europepmc   +1 more source

Constructing Worst Case Instances for Semidefinite Programming Based Approximation Algorithms

, 2001
SL,BAEb#[1 programming based approximation algorithms, such as the Goemans and Williamson approximation algorithm for the MAX CUT problem, are usually shown to have certain performance guarantees using local ratio techniques.
Benny Sudakov, Uri Zwick, Noga Alon
core  

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

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

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

A hierarchy of eigencomputations for polynomial optimization on the sphere. [PDF]

Math Program
Lovitz B, Johnston N.
europepmc   +1 more source