Results 61 to 70 of about 33,726 (205)

A Method for Semidefinite Quasiconvex Maximization Problem

Известия Иркутского государственного университета: Серия "Математика", 2016
We introduce so-called semidefinite quasiconvex maximization problem. We derive new global optimality conditions by generalizing [9]. Using these conditions, we construct an algorithm which generates a sequence of local maximizers that converges to a ...
R. Enkhbat, M. Bellalij, K. Jbilou, T. Bayartugs   +3 more
doaj  

On the Solution of a Nonlinear Semidefinite Program Arising in Discrete-Time Feedback Control Design

Journal of Applied Mathematics, 2014
A sequential quadratic programming method with line search is analyzed and studied for finding the local solution of a nonlinear semidefinite programming problem resulting from the discrete-time output feedback problem.
El-Sayed M. E. Mostafa
doaj   +1 more source

SDP Relaxation Methods for RSS/AOA-Based Localization in Sensor Networks

IEEE Access, 2020
With the fast development of new array technology and intelligent antenna, it is easier to obtain angle of arrival (AOA) measurements. Hybrid received signal strength (RSS) and AOA measurement techniques are proposed for the position computing in sensor ...
Hengnian Qi, Lufeng Mo, Xiaoping Wu
doaj   +1 more source

Cubical coloring — fractional covering by cuts and semidefinite programming [PDF]

Discrete Mathematics & Theoretical Computer Science, 2015
We introduce a new graph parameter that measures fractional covering of a graph by cuts. Besides being interesting in its own right, it is useful for study of homomorphisms and tension-continuous mappings.
Robert Šámal
doaj   +1 more source

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

Journal 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ć, Stefan Nikolić, Rok Spruk   +2 more
wiley   +1 more source

A Three-Dimensional Filter-Based SSDP Method for Nonlinear Semidefinite Programming With Its Applications

Journal of Mathematics
Recently, there has been significant interest in filter methods for solving nonlinear problems. Extensions of these methods to nonlinear semidefinite programming (NLSDP) problems are described.
Dandan Li, Songhua Wang
doaj   +1 more source

Markov Determinantal Point Process for Dynamic Random Sets

Journal 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

Semidefinite descriptions of the convex hull of rotation matrices [PDF]

, 2014
We study the convex hull of $SO(n)$, thought of as the set of $n\times n$ orthogonal matrices with unit determinant, from the point of view of semidefinite programming. We show that the convex hull of $SO(n)$ is doubly spectrahedral, i.e. both it and its
Parrilo, Pablo A., Saunderson, James, Willsky, Alan S.   +2 more
core   +1 more source

Quantum algorithms for conformal bootstrap

Nuclear Physics B, 2019
With the help of recent developments in quantum algorithms for semidefinite programming, we discuss the possibility for quantum speedup for the numerical conformal bootstrap in conformal field theory.
Ning Bao, Junyu Liu
doaj   +1 more source

Distributed Optimization of Finite Condition Number for Laplacian Matrix in Multi‐Agent Systems

International Journal of Robust and Nonlinear Control, Volume 36, Issue 9, Page 5030-5043, June 2026.
ABSTRACT This paper addresses the distributed optimization of the finite condition number of the Laplacian matrix in multi‐agent systems. The finite condition number, defined as the ratio of the largest to the second smallest eigenvalue of the Laplacian matrix, plays an important role in determining the convergence rate and performance of consensus ...
Yicheng Xu, Faryar Jabbari
wiley   +1 more source