Results 1 to 10 of about 113,518 (248)
Some of the next articles are maybe not open access.
Visualizing network communities with a semi-definite programming method
Information Sciences, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wenye Li
semanticscholar +2 more sources
Method of approximate centers for semi-definite programming
Optimization Methods and Software, 1997The success of interior point algorithms for large-scale linear programming has prompted researchers to extend these algorithms to the semi-definite programming (SDP) case. In this paper, the method of approximate centers of Roos and Vial [14] is extended to SDP.
C Roos, E De Klerk, T Terlaky
exaly +2 more sources
Energy, 2021
The increasing installment of distributed generations (DGs) and the tight coupling between active distribution system (ADS) and district heating system (DHS) enhance the flexibility of electricity-heat integrated energy system (IES) to participate in the
Hou-he Chen +3 more
semanticscholar +1 more source
The increasing installment of distributed generations (DGs) and the tight coupling between active distribution system (ADS) and district heating system (DHS) enhance the flexibility of electricity-heat integrated energy system (IES) to participate in the
Hou-he Chen +3 more
semanticscholar +1 more source
A new hybrid method for optimal circuit design using semi-definite programming
Engineering Optimization, 2012Abdel-Karim S O Hassan
exaly +2 more sources
Circle fitting using semi-definite programming
2012 IEEE International Symposium on Circuits and Systems, 2012The fitting of a collection of noisy data points to a circle is a nonlinear and challenging problem, and it plays an important role in many signal processing applications. This paper proposes a semi-definite programming solution for the circle fitting problem based on the semi-definite relaxation technique.
Zhenhua Ma, Le Yang 0001, K. C. Ho 0001
openaire +1 more source
Quantum query complexity and semi-definite programming
18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings., 2004We reformulate quantum query complexity in terms of inequalities and equations for a set of positive semidefinite matrices. Using the new formulation we: 1) show that the workspace of a quantum computer can be limited to at most n+k qubits (where n and k are the number of input and output bits respectively) without reducing the computational power of ...
Howard Barnum +2 more
openaire +1 more source
A logarithm barrier method for semi-definite programming
RAIRO - Operations Research, 2008Summary: This paper presents a logarithmic barrier method for solving a semi-definite linear program. The descent direction is the classical Newton direction. We propose alternative ways to determine the step-size along the direction which are more efficient than classical line-searches.
Jean-Pierre Crouzeix, Bachir Merikhi
openaire +2 more sources
A forward-backward algorithm for decomposable semi-definite programs
2020 28th Mediterranean Conference on Control and Automation (MED), 2020We present semi-decentralized and distributed algorithms, designed via a preconditioned forward-backward operator splitting, for solving large-scale, decomposable semi-definite programs (SDPs). We exploit a chordal aggregate sparsity pattern assumption on the original SDP to obtain a set of mutually coupled SDPs defined on positive semidefinite (PSD ...
Fabiani, Filippo, Grammatico, Sergio
openaire +1 more source