Results 61 to 70 of about 151 (140)
Implementable tensor methods in unconstrained convex optimization. [PDF]
Math Program, 2021 Nesterov Y.
europepmc +1 more source
Explicit Solutions For Interval Semidefinite Linear Programs
, 1993 We consider the special class of semidefinite linear programs (IV P ) maximize trace CX subject to L ¯ A(X) ¯ U; where C; X; L; U are symmetric matrices, A is a (onto) linear operator, and ¯ denotes the Loewner (positive semidefinite) partial order.
Henry Wolkowicz
core
Effectively managing diagnostic tests to monitor the COVID-19 outbreak in Italy. [PDF]
Oper Res Health Care, 2021 Lampariello L, Sagratella S.
europepmc +1 more source
Solving Euclidean Distance Matrix Completion Problems Via Semidefinite Programming
, 1997 . Given a partial symmetric matrix A with only certain elements specified, the Euclidean distance matrix completion problem (EDMCP) is to find the unspecified elements of A that make A a Euclidean distance matrix (EDM).
Abdo Y. Alfakih, Henry Wolkowicz
core
Characterization of the Barrier Parameter of Homogeneous Convex Cones
, 1995 We characterize the barrier parameter of the optimal self--concordant barriers for homogeneous cones. In particular, we prove that for homogeneous convex cones this parameter is the same as the rank of the corresponding Siegel domain.
Osman Güler, Levent Tunçel
core
Employing different loss functions for the classification of images via supervised learning
Open Mathematics, 2014 Boţ Radu, Heinrich André, Wanka Gert
doaj +1 more source
Convex Relaxations Of 0-1 Quadratic Programming
, 1993 We consider three parametric relaxations of the 0-1 quadratic programming problem. These relaxations are to: quadratic maximization over simple box constraints, quadratic maximization over the sphere, and the maximum eigenvalue of a bordered matrix. When
Svatopluk Poljak, Henry Wolkowicz
core
Metric regularity, strong CHIP, and CHIP are distinct properties
, 2007 Metric regularity, the strong conical hull intersection property (strong CHIP), and the conical hull intersection property (CHIP) are properties of a collection of finitely many closed convex intersecting sets in Euclidean space.
Heinz Bauschke +2 more
core
, 1998 The convergence and the complexity of a primal-dual column generation and cutting plane algorithm from approximate analytic centers for solving convex feasibility problems defined by a "deep cut" separation oracle is studied.
Faranak Sharifi-Mokhtarian +1 more
core