Results 101 to 110 of about 6,081 (225)
A Relaxed Interior Point Method for Low-Rank Semidefinite Programming Problems with Applications to Matrix Completion. [PDF]
J Sci Comput, 2021 Bellavia S, Gondzio J, Porcelli M.
europepmc +1 more source
International Journal of Electrical Power & Energy SystemsWith the accelerating integration of distributed energy resources (DERs) into grids, enhanced bidirectional interactions between distribution and transmission systems have significantly complicated grid coordination.
Zhe Chen +5 more
doaj +1 more source
, 1995 In semidefinite programming one minimizes a linear function subject to the constraint that an affine combination of symmetric matrices is positive semidefinite. Such a constraint is nonlinear and nonsmooth, but convex, so semidefinite programs are convex
Lieven Vandenberghe, Stephen Boyd
core
A Reduced Semidefinite Programming Formulation for HA Assignment Problems in Sport Scheduling
Trends in Computational and Applied Mathematics, 2018 Home-Away Assignment problems are naturally cast as quadraticpro gramming models in binary variables. In this work we compare alternative formulations for this kind of problems.
Hugo José Lara +2 more
doaj +1 more source
Reformulations of mathematical programming problems as linear complementarity problems
, 1982 A family of complementarity problems are defined as extensions of the well known Linear Complementarity Problem (LCP). These are (i.) Second Linear Complementarity Problem (SLCP) which is an LCP extended by introducing further equality restrictions and ...
Mitra, G, Judice, JJ
core
Semidefinite Programming for Approximate Maximum Likelihood Sinusoidal Parameter Estimation
EURASIP Journal on Advances in Signal Processing, 2009 We study the convex optimization approach for parameter estimation of several sinusoidal models, namely, single complex/real tone, multiple complex sinusoids, and single two-dimensional complex tone, in the presence of additive Gaussian noise.
Kenneth W. K. Lui, H. C. So
doaj +1 more source
Reducing Stochastic Games to Semidefinite Programming [PDF]
We present a polynomial-time reduction from max-average constraints to the feasibility problem for semidefinite programs. This shows that Condon’s simple stochastic games, stochastic mean payoff games, and in particular mean payoff games and parity games
Skomra, Mateusz +2 more
core +1 more source
Subgraph Matching with Semidefinite Programming
Electronic Notes in Discrete Mathematics, 2003 Abstract We present a convex programming approach to the problem of matching subgraphs which represent object views against larger graphs which represent scenes. Starting from a linear programming formulation for computing optimal matchings in bipartite graphs, we extend the linear objective function in order to take into account the relational ...
Christian Schellewald +1 more
openaire +2 more sources
Exploiting Semidefinite Relaxations in Constraint Programming
, 2006 Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of semidefinite relaxations within constraint programming.
W. J. Van Hoeve +1 more
core +1 more source
Semidefinite programming and matrix scaling over the semidefinite cone
Linear Algebra and its Applications, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources