Compressed sensing off the grid
This paper investigates the problem of estimating the frequency components of a mixture of
s complex sinusoids from a random subset of n regularly spaced samples. Unlike previous …
s complex sinusoids from a random subset of n regularly spaced samples. Unlike previous …
[图书][B] Aspects of semidefinite programming: interior point algorithms and selected applications
E De Klerk - 2006 - books.google.com
Semidefinite programming has been described as linear programming for the year 2000. It is
an exciting new branch of mathematical programming, due to important applications in …
an exciting new branch of mathematical programming, due to important applications in …
[图书][B] Optimierung
F Jarre, J Stoer - 2004 - Springer
Die hier angesprochene Unterscheidung zwischen stetigen und diskreten Problemen ergibt
sich aus den sehr unterschiedlichen Lösungsansätzen. Grob gesprochen kann man bei …
sich aus den sehr unterschiedlichen Lösungsansätzen. Grob gesprochen kann man bei …
Analyzing developer sentiment in commit logs
The paper presents an analysis of developer commit logs for GitHub projects. In particular,
developer sentiment in commits is analyzed across 28,466 projects within a seven year time …
developer sentiment in commits is analyzed across 28,466 projects within a seven year time …
An invitation to tame optimization
AD Ioffe - SIAM Journal on Optimization, 2009 - SIAM
The word “tame” is used in the title in the same context as in expressions like “convex
optimization,”“nonsmooth optimization,” etc.—as a reference to the class of objects involved …
optimization,”“nonsmooth optimization,” etc.—as a reference to the class of objects involved …
First-and second-order methods for semidefinite programming
RDC Monteiro - Mathematical Programming, 2003 - Springer
In this paper, we survey the most recent methods that have been developed for the solution
of semidefinite programs. We first concentrate on the methods that have been primarily …
of semidefinite programs. We first concentrate on the methods that have been primarily …
Solving conic optimization problems via self-dual embedding and facial reduction: a unified approach
F Permenter, HA Friberg, ED Andersen - SIAM Journal on Optimization, 2017 - SIAM
We establish connections between the facial reduction algorithm of Borwein and Wolkowicz
and the self-dual homogeneous model of Goldman and Tucker when applied to conic …
and the self-dual homogeneous model of Goldman and Tucker when applied to conic …
Strong duality and minimal representations for cone optimization
L Tunçel, H Wolkowicz - Computational optimization and applications, 2012 - Springer
The elegant theoretical results for strong duality and strict complementarity for linear
programming, LP, lie behind the success of current algorithms. In addition, preprocessing is …
programming, LP, lie behind the success of current algorithms. In addition, preprocessing is …
Complexity analysis and numerical implementation of a new interior-point algorithm for semidefinite optimization
B Zaoui, D Benterki, S Khelladi - Operations Research Letters, 2024 - Elsevier
Abstract We generalize Zhang and Xu's (2011)[22] interior point algorithm for linear
optimization to semidefinite optimization problems in order to define a new search direction …
optimization to semidefinite optimization problems in order to define a new search direction …
Error bounds and singularity degree in semidefinite programming
S Sremac, HJ Woerdeman, H Wolkowicz - SIAM Journal on Optimization, 2021 - SIAM
In semidefinite programming a proposed optimal solution may be quite poor in spite of
having sufficiently small residual in the optimality conditions. This issue may be framed in …
having sufficiently small residual in the optimality conditions. This issue may be framed in …