Results 71 to 80 of about 54,917 (203)

Logarithmic barriers for sparse matrix cones

open access: yes, 2012
Algorithms are presented for evaluating gradients and Hessians of logarithmic barrier functions for two types of convex cones: the cone of positive semidefinite matrices with a given sparsity pattern, and its dual cone, the cone of sparse matrices with ...
Andersen, Martin S.   +2 more
core   +1 more source

Ethnic Conflicts, Civil War, and Economic Growth: Region‐Level Evidence From Former Yugoslavia

open access: yesJournal of Regional Science, EarlyView.
ABSTRACT This paper studies the long‐term effects of the Yugoslav civil war (1987–1995) on subnational economic growth across 78 regions in five former Yugoslav republics from 1950 to 2015. We construct counterfactual growth trajectories using a robust region‐level donor pool from 32 conflict‐free countries.
Aleksandar Kešeljević   +2 more
wiley   +1 more source

Adaptation of Symmetric Positive Semi-Definite Matrices for the Analysis of Textured Images

open access: yesCybernetics and Information Technologies, 2018
This paper addresses the analysis of textured images using the symmetric positive semi-definite matrix. In particular, a field of symmetric positive semi-definite matrices is used to estimate the structural information represented by the local ...
Akl Adib
doaj   +1 more source

Markov Determinantal Point Process for Dynamic Random Sets

open access: yesJournal of Time Series Analysis, EarlyView.
ABSTRACT The Law of Determinantal Point Process (LDPP) is a flexible parametric family of distributions over random sets defined on a finite state space, or equivalently over multivariate binary variables. The aim of this paper is to introduce Markov processes of random sets within the LDPP framework. We show that, when the pairwise distribution of two
Christian Gouriéroux, Yang Lu
wiley   +1 more source

Efficient Output Kernel Learning for Multiple Tasks [PDF]

open access: yes, 2015
The paradigm of multi-task learning is that one can achieve better generalization by learning tasks jointly and thus exploiting the similarity between the tasks rather than learning them independently of each other.
Hein, Matthias   +3 more
core   +1 more source

Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization

open access: yes, 2016
Completely positive (CP) tensors, which correspond to a generalization of CP matrices, allow to reformulate or approximate a general polynomial optimization problem (POP) with a conic optimization problem over the cone of CP tensors.
Kuang, Xiaolong, Zuluaga, Luis F.
core   +1 more source

Profitability of private brands of e‐commerce platforms offering competing national brands under agency selling

open access: yesInternational Transactions in Operational Research, Volume 33, Issue 5, Page 3336-3358, September 2026.
Abstract This paper investigates the impact of a private brand (PB) introduction by an e‐commerce platform. Contrary to previous research, the platform allows competing manufacturers to sell their national brands (NBs) directly to consumers for an agency fee. Our game‐theoretic analysis allows us to derive the following key insights.
Salma Karray, Simon P. Sigué
wiley   +1 more source

Positive semidefinite biquadratic forms

open access: yesLinear Algebra and its Applications, 1975
AbstractThere is a positive semidefinite biquadratic form that cannot be expressed as the sum of squares of bilinear forms.
openaire   +1 more source

Degree theory for 4‐dimensional asymptotically conical gradient expanding solitons

open access: yesCommunications on Pure and Applied Mathematics, Volume 79, Issue 5, Page 1151-1298, May 2026.
Abstract We develop a new degree theory for 4‐dimensional, asymptotically conical gradient expanding solitons. Our theory implies the existence of gradient expanding solitons that are asymptotic to any given cone over S3$S^3$ with non‐negative scalar curvature. We also obtain a similar existence result for cones whose link is diffeomorphic to S3/Γ$S^3/\
Richard H. Bamler, Eric Chen
wiley   +1 more source

ON THE SET-SEMIDEFINITE REPRESENTATION OF NONCONVEX QUADRATIC PROGRAMS WITH CONE CONSTRAINTS

open access: yesCroatian Operational Research Review, 2010
The well-known result stating that any non-convex quadratic problem over the non-negative orthant with some additional linear and binary constraints can be rewritten as linear problem over the cone of completely positive matrices (Burer, 2009) is ...
Gabriele Eichfelder, Janez Povh
doaj  

Home - About - Disclaimer - Privacy