Results 1 to 10 of about 2,842 (122)
Extensions of P-property, R0-property and semidefinite linear complementarity problems [PDF]
Yugoslav Journal of Operations Research, 2017 In this manuscript, we present some new results for the semidefinite linear complementarity problem, in the context of three notions for linear transformations, viz., pseudo w-P property, pseudo Jordan w-P property and pseudo SSM property ...
Jeyaraman I. +2 more
doaj +4 more sources
A class of singular Ro-matrices and extensions to semidefinite linear complementarity problems [PDF]
Yugoslav Journal of Operations Research, 2013 For ARnxn and qRn, the linear complementarity problem LCP(A, q) is to determine if there is xRn such that x ≥ 0; y = Ax + q ≥ 0 and xT y = 0. Such an x is called a solution of LCP(A,q).
Sivakumar K.C.
doaj +2 more sources
Croatian Operational Research Review, 2018 In this paper, a feasible primal-dual path-following interior-point algorithm for monotone semidefinite linear complementarity problems is proposed. At each iteration, the algorithm uses only full Nesterov-Todd feasible steps for tracing approximately ...
Mohamed Achache, Nersine Tabchouch
doaj +4 more sources
Complexity analysis of primal-dual algorithms for the semidefinite linear complementarity problem
Journal of Numerical Analysis and Approximation Theory, 2011 In this paper a primal-dual path-following interior-point algorithm for the monotone semidefinite linear complementarity problem is presented.
Mohamed Achache, Naima Boudiaf
doaj +4 more sources
A Smoothing Method for Sparse Programs by Symmetric Cone Constrained Generalized Equations
Mathematics, 2023 In this paper, we consider a sparse program with symmetric cone constrained parameterized generalized equations (SPSCC). Such a problem is a symmetric cone analogue with vector optimization, and we aim to provide a smoothing framework for dealing with ...
Cong Cheng, Lianjie Tang
doaj +1 more source
Bad semidefinite programs: they all look the same [PDF]
, 2017 Conic linear programs, among them semidefinite programs, often behave pathologically: the optimal values of the primal and dual programs may differ, and may not be attained. We present a novel analysis of these pathological behaviors.
Bauschke H. +6 more
core +3 more sources
On the local stability of semidefinite relaxations
, 2020 We consider a parametric family of quadratically constrained quadratic programs (QCQP) and their associated semidefinite programming (SDP) relaxations. Given a nominal value of the parameter at which the SDP relaxation is exact, we study conditions (and ...
Agarwal, Sameer +3 more
core +1 more source
Convergence analysis of an Inexact Infeasible Interior Point method for Semidefinite Programming [PDF]
, 2004 In this paper we present an extension to SDP of the well known infeasible Interior Point method for linear programming of Kojima,Megiddo and Mizuno (A primal-dual infeasible-interior-point algorithm for Linear Programming, Math. Progr., 1993).
Bellavia, S, Pieraccini, Sandra
core +1 more source
Bilinearity rank of the cone of positive polynomials and related cones [PDF]
, 2010 For a proper cone K ⊂ Rn and its dual cone K the complementary slackness condition xT s = 0 defines an n-dimensional manifold C(K) in the space { (x, s) | x ∈ K, s ∈ K^* }. When K is a symmetric cone, this manifold can be described by a set of n bilinear
Alizadeh, Farid +3 more
core +3 more sources
A note on Probably Certifiably Correct algorithms [PDF]
, 2015 Many optimization problems of interest are known to be intractable, and while there are often heuristics that are known to work on typical instances, it is usually not easy to determine a posteriori whether the optimal solution was found.
Bandeira, Afonso S.
core +3 more sources