Sciweavers

191 search results - page 14 / 39
» Second-Order Programs with Preconditions
Sort
View
SIAMJO
2002
96views more  SIAMJO 2002»
13 years 7 months ago
Lagrangian Dual Interior-Point Methods for Semidefinite Programs
This paper proposes a new predictor-corrector interior-point method for a class of semidefinite programs, which numerically traces the central trajectory in a space of Lagrange mul...
Mituhiro Fukuda, Masakazu Kojima, Masayuki Shida
ISAAC
2010
Springer
240views Algorithms» more  ISAAC 2010»
13 years 5 months ago
Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity
We study polynomial time complexity of type 2 functionals. For that purpose, we introduce a first order functional stream language. We give criteria, named well-founded, on such pr...
Hugo Férée, Emmanuel Hainry, Mathieu...
JMLR
2006
175views more  JMLR 2006»
13 years 7 months ago
Learning Sparse Representations by Non-Negative Matrix Factorization and Sequential Cone Programming
We exploit the biconvex nature of the Euclidean non-negative matrix factorization (NMF) optimization problem to derive optimization schemes based on sequential quadratic and secon...
Matthias Heiler, Christoph Schnörr
MP
2008
91views more  MP 2008»
13 years 7 months ago
The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
We analyze the rate of local convergence of the augmented Lagrangian method for nonlinear semidefinite optimization. The presence of the positive semidefinite cone constraint requ...
Defeng Sun, Jie Sun, Liwei Zhang
APLAS
2005
ACM
14 years 29 days ago
Symbolic Execution with Separation Logic
We describe a sound method for automatically proving Hoare triples for loop-free code in Separation Logic, for certain preconditions and postconditions (symbolic heaps). The method...
Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn