Results 31 to 40 of about 6,028,400 (221)
ON OPTIMUM DESIGN OF FRAME STRUCTURES
Acta Polytechnica CTU Proceedings, 2020 Optimization of frame structures is formulated as a non-convex optimization problem, which is currently solved to local optimality. In this contribution, we investigate four optimization approaches: (i) general non-linear optimization, (ii) optimality ...
Marek Tyburec +3 more
doaj +1 more source
Variational density matrix optimization using semidefinite programming [PDF]
, 2011 We discuss how semidefinite programming can be used to determine the second-order density matrix directly through a variational optimization. We show how the problem of characterizing a physical or N -representable density matrix leads to matrix ...
Boyd +22 more
core +2 more sources
Distributionally Robust Joint Chance Constrained Problem under Moment Uncertainty
Journal of Applied Mathematics, 2014 We discuss and develop the convex approximation for robust joint chance constraints under uncertainty of first- and second-order moments. Robust chance constraints are approximated by Worst-Case CVaR constraints which can be reformulated by a ...
Ke-wei Ding
doaj +1 more source
On the Embed and Project Algorithm for the Graph Bandwidth Problem
Mathematics, 2021 The graph bandwidth problem, where one looks for a labeling of graph vertices that gives the minimum difference between the labels over all edges, is a classical NP-hard problem that has drawn a lot of attention in recent decades. In this paper, we focus
Janez Povh
doaj +1 more source
Semidefinite Programming Converse Bounds for Quantum Communication [PDF]
IEEE Transactions on Information Theory, 2017 We derive several efficiently computable converse bounds for quantum communication over quantum channels in both the one-shot and asymptotic regime.
Xin Wang, K. Fang, R. Duan
semanticscholar +1 more source
Critical Multipliers in Semidefinite Programming [PDF]
Asia-Pacific Journal of Operational Research, 2020 It was proved in Izmailov and Solodov (2014). Newton-Type Methods for Optimization and Variational Problems, Springer] that the existence of a noncritical multiplier for a (smooth) nonlinear programming problem is equivalent to an error bound condition for the Karush–Kuhn–Thcker (KKT) system without any assumptions.
Zhang, Tianyu, Zhang, Liwei
openaire +3 more sources
A Rank-Two Feasible Direction Algorithm for the Binary Quadratic Programming
Journal of Applied Mathematics, 2013 Based on the semidefinite programming relaxation of the binary quadratic programming, a rank-two feasible direction algorithm is presented. The proposed algorithm restricts the rank of matrix variable to be two in the semidefinite programming relaxation ...
Xuewen Mu, Yaling Zhang
doaj +1 more source
Variational Quantum Algorithms for Semidefinite Programming [PDF]
QuantumA semidefinite program (SDP) is a particular kind of convex optimization problem with applications in operations research, combinatorial optimization, quantum information science, and beyond.
Dhrumil Patel +2 more
doaj +1 more source
Sum-of-Squares Optimization without Semidefinite Programming [PDF]
SIAM Journal on Optimization, 2017 We propose a homogeneous primal-dual interior-point method to solve sum-of-squares optimization problems by combining non-symmetric conic optimization techniques and polynomial interpolation.
D. Papp, Sercan Yıldız
semanticscholar +1 more source
Sensors, 2018 The energy reading has been an efficient and attractive measure for collaborative acoustic source localization in practical application due to its cost saving in both energy and computation capability.
Yongsheng Yan +4 more
doaj +1 more source