Journal of Geophysical Research: Atmospheres, Volume 131, Issue 1, 16 January 2026.Abstract Biomass burning aerosols influence atmospheric temperatures by absorbing solar radiation, thereby altering the contrast between day and night temperatures. This study investigates the correlation between these aerosols and day‐night (D‐N) temperature changes over India by applying principal component analysis (PCA) in long‐term (2003–2021 ...
Lakhima Chutia +5 more
wiley +1 more source
Exploiting Sparsity in SDP Relaxation for Harmonic Balance Method
IEEE Access, 2020 In general, harmonic balance problems are extremely nonconvex and difficult to solve. A convex relaxation in the form of semidefinite programming has attracted a lot of attention recently, as it finds a global solution with high accuracy without the need
Cheng-Hsiung Yang, Ben Shen Deng
doaj +1 more source
A Polynomial Optimization Approach to Constant Rebalanced Portfolio Selection [PDF]
We address the multi-period portfolio optimization problem with the constant rebalancing strategy. This problem is formulated as a polynomial optimization problem (POP) by using a mean-variance criterion.
Sotirov, R., Takano, Y.
core +1 more source
Bounding Option Prices Using SDP With Change Of Numeraire [PDF]
Recently, given the first few moments, tight upper and lower bounds of the no arbitrage prices can be obtained by solving semidefinite programming (SDP) or linear programming (LP) problems.
Berc Rustem, Kai Ye, Panos Parpas
core
Linear Programming Relaxations of Quadratically Constrained Quadratic Programs
, 2011 We investigate the use of linear programming tools for solving semidefinite programming relaxations of quadratically constrained quadratic problems. Classes of valid linear inequalities are presented, including sparse PSD cuts, and principal minors PSD ...
Belotti, Pietro +2 more
core +2 more sources
Adaptive Clustering through Semidefinite Programming
, 2017 We analyze the clustering problem through a flexible probabilistic model that aims to identify an optimal partition on the sample X 1 , ..., X n. We perform exact clustering with high probability using a convex semidefinite estimator that interprets as a
Royer, Martin
core
A Relaxed Interior Point Method for Low-Rank Semidefinite Programming Problems with Applications to Matrix Completion. [PDF]
J Sci Comput, 2021 Bellavia S, Gondzio J, Porcelli M.
europepmc +1 more source
Semidefinite programming and matrix scaling over the semidefinite cone
Linear Algebra and its Applications, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
On Semidefinite Programming Relaxations of Association Schemes With Application to Combinatorial Optimization Problems [PDF]
AMS classification: 90C22, 20Cxx, 70-08traveling salesman problem;maximum bisection;semidefinite programming;association ...
Klerk, E. de, Pasechnik, D.V.
core +1 more source
A Reduced Semidefinite Programming Formulation for HA Assignment Problems in Sport Scheduling
Trends in Computational and Applied Mathematics, 2018 Home-Away Assignment problems are naturally cast as quadraticpro gramming models in binary variables. In this work we compare alternative formulations for this kind of problems.
Hugo José Lara +2 more
doaj +1 more source