SearcharxivSearch

arXiv subjects

Vittorio Latorre

Publications and source records attributed to Vittorio Latorre.

11 recordsLinked to original sources

Graph Neural Networks Trained on Null Signal for Angle Reconstruction in X-ray Polarimetry

Scientific real detectors often produce sparse, irregular data defined on non-Euclidean domains, where conventional convolutional neural networks (CNNs) impose geometric biases that distort physical observables. In X-ray polarimetry, such distortions can mimic polarization signals at the percent level, critically limiting measurement fidelity. We consider a framework based on Graph Neural Networks (GNNs) for reconstructing photoelectron emission angles from Gas Pixel Detectors, operating directly on their native sparse hexagonal topology. The network is trained solely on unpolarized simulated data and integrates rotational data augmentation, ensemble averaging, and modulation-aware model selection to reduce spurious angular modulation. Despite never encountering polarized examples, the model is able to recover the overall structure of polarized signals. Compared with the classical Method of Moments (MoM), an analytical approach to track angle reconstruction, the proposed GNN achieves lower per-track error but yields worse performance for polarimetry, revealing a mismatch between local reconstruction accuracy and global polarimetric performance. Compared to CNN-based approaches, the framework shows competitive performance on both unpolarized and polarized reconstructions, despite being trained in a more challenging power-law energy distribution. These results position the method as a diagnostic tool to highlight the limitations and trade-offs of learning-based approaches for X-ray-polarimetry signal reconstruction.

astro-ph.IM

On Implicit Concave Structures in Half-Quadratic Methods for Signal Reconstruction

In this work, we introduce a new class of non-convex functions, called implicit concave functions, which are compositions of a concave function with a continuously differentiable mapping. We analyze the properties of their minimization by leveraging Fenchel conjugate theory to construct an augmented optimization problem. This reformulation yields a one-to-one correspondence between the stationary points and local minima of the original and augmented problems. Crucially, the augmented problem admits a natural variable splitting that reveals convexity with respect to at least one block, and, in some cases, leading to a biconvex structure that is more amenable to optimization. This enables the use of efficient block coordinate descent algorithms for solving otherwise non-convex problems. As a representative application, we show how this framework applies to half-quadratic regularization in signal reconstruction and image processing. We demonstrate that common edge-preserving regularizers fall within the proposed class, and that their corresponding augmented problems are biconvex and bounded from below. Our results offer both a theoretical foundation and a practical pathway for solving a broad class of structured non-convex problems.

math.OC

Duality for Non Convex Composite Functions via the Fenchel Rockafellar Perturbation Framework

We examine the duality theory for a class of non-convex functions obtained by composing a convex function with a continuous one. Using Fenchel duality, we derive a dual problem that satisfies weak duality under general assumptions. To better understand this duality, we compare it with classical Lagrange duality by analyzing a related, yet more complex, constrained problem. We demonstrate that the newly derived stationarity conditions are equivalent to the classical Lagrange stationarity conditions for the constrained problem, as expected by the close relationship between Fenchel and Lagrange dualities. We introduce two non-convex optimization problems and prove strong duality results with their respective duals. The second problem is a constrained optimization problem whose dual is obtained through the concurrent use of the duality theory introduced in this paper and classical Lagrange duality for constrained optimization. We also report numerical tests where we solve randomly generated instances of the presented problems using an ad-hoc primal-dual potential reduction interior point method that directly exploits the global optimality conditions established in this paper. The results include a comparison with a well-known conic programming solver applied to the convex duals of the analyzed problems. The interior point method successfully reduces the duality gap close to zero, validating the proposed duality framework. The theory presented in this paper can be applied to various non-convex problems and serves as a valuable tool in the field of hidden convex optimization.

math.OC

Automated Road Safety: Enhancing Sign and Surface Damage Detection with AI

Public transportation plays a crucial role in our lives, and the road network is a vital component in the implementation of smart cities. Recent advancements in AI have enabled the development of advanced monitoring systems capable of detecting anomalies in road surfaces and road signs, which, if unaddressed, can lead to serious road accidents. This paper presents an innovative approach to enhance road safety through the detection and classification of traffic signs and road surface damage using advanced deep learning techniques. This integrated approach supports proactive maintenance strategies, improving road safety and resource allocation for the Molise region and the city of Campobasso. The resulting system, developed as part of the Casa delle Tecnologie Emergenti (House of Emergent Technologies) Molise (Molise CTE) research project funded by the Italian Minister of Economic Growth (MIMIT), leverages cutting-edge technologies such as Cloud Computing and High Performance Computing with GPU utilization. It serves as a valuable tool for municipalities, enabling quick detection of anomalies and the prompt organization of maintenance operations

cs.DC

Topology Optimization with Bilevel Knapsack: An Efficient 51 Lines MATLAB Code

This paper presents an efficient 51 lines Matlab code to solve topology optimization problems. By the fact that the presented code is based on an hard 0-1 optimization method that handles the integer part of the optimization in a simple fashion and in sub-polynomial time, it has been possible to not only reduce the number of lines to 51 without sacrificing any readability, but also to obtain void-solid designs with close to none checkerboard patterns with improved efficiency. The numerical results in the paper show that the proposed method has the best average times compared to several codes available in literature. We also present extensions to different boundary conditions and to three dimensional designs. The code can be used by students and the newcomers in topology optimization because of its simplicity and readability. The 51 lines Matlab code and the presented extensions can be downloaded on the webpage https://github.com/vlatorre847/TOSSE.

math.OC

Global Optimal Trajectory in Chaos and NP-Hardness

This paper presents a new canonical duality methodology for solving general nonlinear dynamical systems. Instead of the conventional iterative methods, the discretized nonlinear system is first formulated as a global optimization problem via the least squares method. The canonical duality theory shows that this nonconvex minimization problem can be solved deterministically in polynomial time if a global optimality condition is satisfied. The so-called pseudo-chaos produced by Runge-Kutta type of linear iterations are mainly due to the intrinsic numerical error accumulations. Otherwise, the global optimization problem could be NP-hard and the nonlinear system can be really chaotic. A conjecture is proposed, which reveals the connection between chaos in nonlinear dynamics and NP-hardness in computer science. The methodology and the conjecture are verified by applications to the well-known logistic equation, a forced memristive circuit and the Lorenz system. Computational results show that the canonical duality theory can be used to identify chaotic systems and to obtain realistic global optimal solutions in nonlinear dynamical systems.

math.OC

Canonical Duality-Triality Theory: Bridge Between Nonconvex Analysis/Mechanics and Global Optimization in Complex Systems

Canonical duality-triality is a breakthrough methodological theory, which can be used not only for modeling complex systems within a unified framework, but also for solving a wide class of challenging problems from real-world applications. This paper presents a brief review on this theory, its philosophical origin, physics foundation, and mathematical statements in both finite and infinite dimensional spaces, with emphasizing on its role for bridging the gap between nonconvex analysis/mechanics and global optimization. Special attentions are paid on unified understanding the fundamental difficulties in large deformation mechanics, bifurcation/chaos in nonlinear science, and the NP-hard problems in global optimization, as well as the theorems, methods, and algorithms for solving these challenging problems. Misunderstandings and confusions on some basic concepts, such as objectivity, nonlinearity, Lagrangian, and generalized convexities are discussed and classified. Breakthrough from recent challenges and conceptual mistakes by M. Voisei, C. Zalinescu and his co-worker are addressed. Some open problems and future works in global optimization and nonconvex mechanics are proposed.

math-ph

A Potential Reduction Method for Canonical Duality, with an Application to the Sensor Network Localization Problem

We propose to solve large instances of the non-convex optimization problems reformulated with canonical duality theory. To this aim we propose an interior point potential reduction algorithm based on the solution of the primal-dual total complementarity (Lagrange) function. We establish the global convergence result for the algorithm under mild assumptions and demonstrate the method on instances of the Sensor Network Localization problem. Our numerical results are promising and show the possibility of devising efficient interior points methods for non-convex duality.

math.OC

Canonical Dual Approach for Contact Mechanics Problems with Friction

This paper presents an application of Canonical duality theory to the solution of contact problems with Coulomb friction. The contact problem is formulated as a quasi-variational inequality which solution is found by solving its Karush-Kunt-Tucker system of equations. The complementarity conditions are reformulated by using the Fischer-Burmeister complementarity function, obtaining a non-convex global optimization problem. Then canonical duality theory is applied to reformulate the non-convex global optimization problem and define its optimality conditions, finding a solution of the original quasi-variational inequality. We also propose a methodology for finding the solutions of the new formulation, and report the results on well known instances from literature.

math.OC

Canonical duality for solving general nonconvex constrained problems

This paper presents a canonical duality theory for solving a general nonconvex constrained optimization problem within a unified framework to cover Lagrange multiplier method and KKT theory. It is proved that if both target function and constraints possess certain patterns necessary for modeling real systems, a perfect dual problem (without duality gap)can be obtained in a unified form with global optimality conditions provided. While the popular augmented Lagrangian method may produce more difficult nonconvex problems due to the nonlinearity of constraints.

math.OC

Canonical dual solutions to nonconvex radial basis neural network optimization problem

Radial Basis Functions Neural Networks (RBFNNs) are tools widely used in regression problems. One of their principal drawbacks is that the formulation corresponding to the training with the supervision of both the centers and the weights is a highly non-convex optimization problem, which leads to some fundamentally difficulties for traditional optimization theory and methods. This paper presents a generalized canonical duality theory for solving this challenging problem. We demonstrate that by sequential canonical dual transformations, the nonconvex optimization problem of the RBFNN can be reformulated as a canonical dual problem (without duality gap). Both global optimal solution and local extrema can be classified. Several applications to one of the most used Radial Basis Functions, the Gaussian function, are illustrated. Our results show that even for one-dimensional case, the global minimizer of the nonconvex problem may not be the best solution to the RBFNNs, and the canonical dual theory is a promising tool for solving general neural networks training problems.

cs.NE