Results 51 to 60 of about 570 (72)

On the convergence of the central path in semidefinite optimization. [PDF]

Halická, M., Klerk, E. de, Roos, C.
core   +1 more source

Reduction of symmetric semidefinite programs using the regular*-representation. [PDF]

Klerk, E. de, Pasechnik, D.V., Schrijver, A.   +2 more
core   +1 more source

Some of the next articles are maybe not open access.

Related searches:

On Optimality Conditions for Nonlinear Conic Programming

Mathematics of Operations Research, 2022
Roberto Andreani, Walter Gomez, Gabriel Haeser   +2 more
exaly  

TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity

SIAM Journal on Optimization, 2021
Jie Wang, Victor Magron, Jean Bernard Lasserre   +2 more
exaly  

A Sparse Version of Reznick’s Positivstellensatz

Mathematics of Operations Research, 2023
Victor Magron, Jean Bernard Lasserre
exaly  

Exactness of Parrilo’s Conic Approximations for Copositive Matrices and Associated Low Order Bounds for the Stability Number of a Graph

Mathematics of Operations Research, 2023
Monique Laurent, Luis Felipe Vargas
exaly  

A Semidefinite Relaxation Method for Partially Symmetric Tensor Decomposition

Mathematics of Operations Research, 2022
Guyan Ni
exaly  

Time-Varying Semidefinite Programs

Mathematics of Operations Research, 2021
Amir Ali Ahmadi, Bachir El Khadir
exaly  

GloptiPoly 3: moments, optimization and semidefinite programming

Optimization Methods and Software, 2009
Didier Henrion, Johan Löfberg
exaly  

Global Optimization with Polynomials and the Problem of Moments

SIAM Journal on Optimization, 2001
Jean Bernard Lasserre
exaly