Suchergebnisse - "Semidefinite Programming"

A variety of optimization techniques applied in the context of quantum information theory

Autoren: Mortimer, Luke Bailey

Weitere Verfasser: University/Department: Universitat Politècnica de Catalunya. Institut de Ciències Fotòniques

Thesis Advisors: Acín dal Maschio, Antonio

Quelle: TDX (Tesis Doctorals en Xarxa)

Schlagwörter: quantum information theory, semidefinite programming, mutually unbiased bases, nonlocality, many-body quantum physics, Àrees temàtiques de la UPC::Enginyeria de la telecomunicació, Àrees temàtiques de la UPC::Física, 621.3 - Enginyeria elèctrica. Electrotècnia. Telecomunicacions, 530. 1 - Principis generals de la física

Dateibeschreibung: application/pdf

Zugangs-URL: http://hdl.handle.net/10803/695487
https://dx.doi.org/10.5821/dissertation-2117-443521

A Squared Smoothing Newton Method for Semidefinite Programming.

Autoren: Liang, Ling Sun, Defeng Toh, Kim-Chuan

Quelle: Mathematics of Operations Research. Nov2025, Vol. 50 Issue 4, p2873-2908. 36p.

Schlagwörter: SEMIDEFINITE programming, SMOOTHING (Numerical analysis), NUMERICAL analysis

A new dual spectral projected gradient method for log-determinant semidefinite programming with hidden clustering structures.

Autoren: Namchaisiri, Charles Liu, Tianxiang Yamashita, Makoto

Quelle: Computational Optimization & Applications. Nov2025, Vol. 92 Issue 2, p589-615. 27p.

Schlagwörter: SEMIDEFINITE programming, CLUSTERING algorithms, OPTIMIZATION algorithms, NUMERICAL analysis, COMPUTATIONAL complexity, STATISTICAL models, GLOBAL optimization

On rank-monotone graph operations and minimal obstruction graphs for the Lovász–Schrijver SDP hierarchy.

Autoren: Au, Yu Hin Tunçel, Levent

Quelle: Mathematical Programming. Sep2025, Vol. 213 Issue 1/2, p1169-1209. 41p.

Schlagwörter: GRAPH theory, SEMIDEFINITE programming, GRAPH algorithms, POLYTOPES

Neural spectrahedra and semidefinite lifts: global convex optimization of degree-two polynomial activation neural networks in polynomial-time.

Autoren: Bartan, Burak Pilanci, Mert

Quelle: Mathematical Programming. Sep2025, Vol. 213 Issue 1/2, p737-769. 33p.

Schlagwörter: *ARTIFICIAL neural networks, SEMIDEFINITE programming, GLOBAL optimization, COST functions, COMPUTATIONAL complexity, CONVEX programming, BACK propagation

Complexity of chordal conversion for sparse semidefinite programs with small treewidth.

Autoren: Zhang, Richard Y.¹ (AUTHOR) ryz@illinois.edu

Quelle: Mathematical Programming. Sep2025, Vol. 213 Issue 1/2, p201-237. 37p.

Schlagwörter: *MATHEMATICAL optimization, SEMIDEFINITE programming, INTERIOR-point methods, SPARSE matrices, GRAPH theory

Matrix discrepancy and the log-rank conjecture.

Autoren: Sudakov, Benny Tomon, István

Quelle: Mathematical Programming. Jul2025, Vol. 212 Issue 1, p567-579. 13p.

Schlagwörter: SEMIDEFINITE programming, BOOLEAN functions, LOGICAL prediction, MATRICES (Mathematics)

Stable set polytopes with high lift-and-project ranks for the Lovász–Schrijver SDP operator.

Autoren: Au, Yu Hin Tunçel, Levent

Quelle: Mathematical Programming. Jul2025, Vol. 212 Issue 1, p79-114. 36p.

Schlagwörter: *INTEGER programming, SEMIDEFINITE programming, COMBINATORIAL optimization, SQUARE root

Homotopy Methods for Convex Optimization.

Autoren: Klingler, Andreas Netzer, Tim

Quelle: SIAM Journal on Optimization. 2025, Vol. 35 Issue 3, p1498-1523. 26p.

Schlagwörter: *MATHEMATICAL optimization, CONVEX programming, SEMIDEFINITE programming, GEOMETRIC programming, QUADRATIC programming, INTERIOR-point methods

Certifying Solutions of Degenerate Semidefinite Programs.

Autoren: Kolmogorov, Vladimir Naldi, Simone Zapata, Jeferson

Quelle: SIAM Journal on Optimization. 2025, Vol. 35 Issue 3, p1630-1654. 25p.

Schlagwörter: *FEASIBILITY studies, *ALGORITHMS, *HEURISTIC, SEMIDEFINITE programming, OPTIMIZATION algorithms, ALGEBRAIC geometry, POLYNOMIALS

The Lovász Theta Function for Recovering Planted Clique Covers and Graph Colorings.

Autoren: Hou, Jiaxin Soh, Yong Sheng Varvitsiotis, Antonios

Quelle: SIAM Journal on Optimization. 2025, Vol. 35 Issue 3, p1873-1898. 26p.

Schlagwörter: GRAPH coloring, SEMIDEFINITE programming, NP-hard problems, GRAPH theory, COMBINATORIAL optimization

An improved approximation algorithm for Hypergraph Max [formula omitted]-Section.

Autoren: Li, Guangfeng Sun, Jian Gao, Jiaquan et al.

Quelle: Discrete Applied Mathematics. Dec2025, Vol. 377, p102-112. 11p.

Schlagwörter: *APPROXIMATION algorithms, *SEMIDEFINITE programming, *HYPERGRAPHS, *PERTURBATION theory, *APPROXIMATION error, *DETERMINISTIC algorithms

Symmetry reduction for testing k -block-positivity via extendibility.

Autoren: Chen, Qian Collins, Benoît Fawzi, Omar

Quelle: Journal of Physics A: Mathematical & Theoretical. 2025, Vol. 58 Issue 48, p1-23. 23p.

Schlagwörter: *SEMIDEFINITE programming, *QUANTUM entanglement, *MATHEMATICAL optimization, *TENSOR products, *SYMMETRY

Day-Ahead Coordinated Reactive Power Optimization Dispatching Based on Semidefinite Programming.

Autoren: Xu, Binbin Liu, Mengqi Zhong, Yilin et al.

Quelle: Energies (19961073). Oct2025, Vol. 18 Issue 20, p5469. 21p.

Schlagwörter: *REACTIVE power, *SEMIDEFINITE programming, *INTEGER programming, *OPERATING costs, *OPTIMIZATION algorithms, *REAL variables, *MATHEMATICAL variables

Optimization tools for computing colorings of [formula omitted] with few monochromatic solutions on 3-variable linear equations.

Autoren: De Loera, Jesús A. Ventura, Denae Wang, Liuyue et al.

Quelle: Discrete Applied Mathematics. Oct2025, Vol. 373, p159-178. 20p.

Schlagwörter: *RAMSEY theory, *SEMIDEFINITE programming, *LINEAR equations, *ARITHMETIC, *MATHEMATICAL optimization, *RAMSEY numbers

Optimal Diagonal Preconditioning.

Autoren: Qu, Zhaonan Gao, Wenzhi Hinder, Oliver et al.

Quelle: Operations Research. May/Jun2025, Vol. 73 Issue 3, p1479-1495. 17p.

Schlagwörter: *MATHEMATICAL optimization, SEMIDEFINITE programming, CONVEX programming, OPTIMIZATION algorithms, SPARSE matrices

On the tightness of an SDP relaxation for homogeneous QCQP with three real or four complex homogeneous constraints.

Autoren: Ai, Wenbao Liang, Wei Yuan, Jianhua

Quelle: Mathematical Programming. May2025, Vol. 211 Issue 1, p5-48. 44p.

Schlagwörter: SEMIDEFINITE programming, QUADRATIC programming, CLASSICAL literature

Global optimization for cardinality-constrained minimum sum-of-squares clustering via semidefinite programming.

Autoren: Piccialli, Veronica Sudoso, Antonio M.

Quelle: Mathematical Programming. May2025, Vol. 211 Issue 1, p245-279. 35p.

Schlagwörter: SEMIDEFINITE programming, GLOBAL optimization, K-means clustering, SUM of squares, PRIOR learning

Algorithm 1055: HDSDP: Software for Semidefinite Programming.

Autoren: WENZHI GAO DONGDONG GE YINYU YE

Quelle: ACM Transactions on Mathematical Software. Jun2025, Vol. 51 Issue 2, p1-30. 30p.

Schlagwörter: *ALGORITHMS, *HEURISTIC, INTERIOR-point methods, SEMIDEFINITE programming, DESIGN techniques

Strong global convergence properties of algorithms for nonlinear symmetric cone programming.

Autoren: Andreani, R. Haeser, G. Ramos, A. et al.

Quelle: Computational Optimization & Applications. Jun2025, Vol. 91 Issue 2, p397-421. 25p.

Schlagwörter: *NONLINEAR programming, INTERIOR-point methods, SEMIDEFINITE programming, LAGRANGIAN points, CONES