Results 31 to 40 of about 113,518 (248)

Universal Prediction Band via Semi-Definite Programming [PDF]

open access: yesJournal of the Royal Statistical Society Series B: Statistical Methodology, 2021
AbstractWe propose a computationally efficient method to construct nonparametric, heteroscedastic prediction bands for uncertainty quantification, with or without any user-specified predictive model. Our approach provides an alternative to the now-standard conformal prediction for uncertainty quantification, with novel theoretical insights and ...
openaire   +4 more sources

An SDP Dual Relaxation for the Robust Shortest-Path Problem with Ellipsoidal Uncertainty: Pierra’s Decomposition Method and a New Primal Frank–Wolfe-Type Heuristics for Duality Gap Evaluation

open access: yesMathematics, 2022
This work addresses the robust counterpart of the shortest path problem (RSPP) with a correlated uncertainty set. Because this problem is difficult, a heuristic approach, based on Frank–Wolfe’s algorithm named discrete Frank–Wolfe (DFW), has recently ...
Chifaa Al Dahik   +4 more
doaj   +1 more source

A Semi-Definite Programming Approach to Robust Adaptive MPC under State Dependent Uncertainty [PDF]

open access: yesEuropean Control Conference, 2019
We propose an Adaptive MPC framework for uncertain linear systems to achieve robust satisfaction of state and input constraints. The uncertainty in the system is assumed additive, state dependent, and globally Lipschitz with a known Lipschitz constant ...
Monimoy Bujarbaruah   +2 more
semanticscholar   +1 more source

Target Localization in Wireless Sensor Networks Based on Received Signal Strength and Convex Relaxation

open access: yesSensors, 2022
A new positioning algorithm based on RSS measurement is proposed. The algorithm adopts maximum likelihood estimation and semi-definite programming. The received signal strength model is transformed to a non-convex estimator for the positioning of the ...
Weizhong Ding   +4 more
doaj   +1 more source

Coupling policy iteration with semi-definite relaxation to compute accurate numerical invariants in static analysis [PDF]

open access: yesLogical Methods in Computer Science, 2012
We introduce a new domain for finding precise numerical invariants of programs by abstract interpretation. This domain, which consists of level sets of non-linear functions, generalizes the domain of linear "templates" introduced by Manna ...
Assalé Adjé   +2 more
doaj   +1 more source

An Online Semi-Definite Programming with a Generalized Log-Determinant Regularizer and Its Applications

open access: yesMathematics, 2022
We consider a variant of the online semi-definite programming problem (OSDP). Specifically, in our problem, the setting of the decision space is a set of positive semi-definite matrices constrained by two norms in parallel: the L∞ norm to the diagonal ...
Yaxiong Liu   +3 more
doaj   +1 more source

A semi-definite programming approach to stability analysis of linear partial differential equations [PDF]

open access: yesIEEE Conference on Decision and Control, 2017
We consider the stability analysis of a large class of linear 1-D PDEs with polynomial data. This class of PDEs contains, as examples, parabolic and hyperbolic PDEs with spatially varying coefficients and systems of in-domain/boundary coupled PDEs.
Aditya Gahlawat, G. Valmorbida
semanticscholar   +1 more source

Linear programming with positive semi definite matrices [PDF]

open access: yesProceedings of 1995 34th IEEE Conference on Decision and Control, 1996
We consider the general linear programming problem over the cone of positive semi‐definite matrices. We first provide a simple sufficient condition for existence of optimal solutions and absence of a duality gap without requiring existence of a strictly feasible solution.
openaire   +2 more sources

Compressed Sensing Linear Array SAR Autofocusing Imaging via Semi-definite Programming

open access: yesLeida xuebao, 2018
Linear Array Synthetic Aperture Radar (LASAR) is a novel and promising radar imaging technique. In recent years, Compressed Sensing (CS) sparse recovery has been a research focus for high-resolution three-Dimensional (3-D) LASAR imaging.
Wei Shunjun   +3 more
doaj   +1 more source

Parallel Jobs Scheduling with a Specific Due Date: Asemi-definite Relaxation-based Algorithm [PDF]

open access: yesJournal of Optimization in Industrial Engineering, 2020
This paper considers a different version of the parallel machines scheduling problem in which the parallel jobs simultaneously requirea pre-specifiedjob-dependent number of machines when being processed.This relaxation departs from one of the classic ...
Javad Behnamian
doaj   +1 more source

Home - About - Disclaimer - Privacy