Results 61 to 70 of about 166 (143)
Trust Region Affine Scaling Algorithms for Linearly Constrained Convex and Concave Programs
, 1996 We study a trust region affine scaling algorithm for solving the linearly constrained convex or concave programming problem. Under primal nondegeneracy assumption, we prove that every accumulation point of the sequence generated by the algorithm ...
Yanhui Wang, Renato D.C. Monteiro
core
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
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
Convex analysis on the Hermitian matrices
, 1996 There is growing interest in optimization problems with real symmetric matrices as variables. Generally the matrix functions involved are spectral: they depend only on the eigenvalues of the matrix.
A. S. Lewis
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
A Newton-like Method for Nonlinear Semidefinite Inequalities
, 2007 A matrix map F (x) is said to be (matricially) convex, if u T F (x)u is a convex function for every u. In this paper, semidefinite systems of the type F (x) ¯ 0, where F (x) is matricially convex, are considered. This class of problems generalizes both
Motakuri Ramana, A. J. Goldman
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