6 papers
Global solutions for the sensors placement problem via weakly convex optimization
Giovanni Bruccola
We address the problem of optimally placing a limited number of sensors to reconstruct high-dimensional signals without knowledge of the underlying dynamics. The task is formulated…
Outer Approximation Scheme for Weakly Convex Constrained Optimization Problems
Ewa M. Bednarczuk, Giovanni Bruccola, Jean-Christophe Pesquet +1
Outer approximation methods have long been employed to tackle a variety of optimization problems, including linear programming, in the 1960s, and continue to be effective for solvi…
Forward-Backward algorithms for weakly convex problems
Ewa Bednarczuk, Giovanni Bruccola, Gabriele Scrivanti +1
We investigate the convergence properties of exact and inexact forward-backward algorithms to minimise the sum of two weakly convex functions defined on a Hilbert space, where one…
On global solvability of a class of possibly nonconvex QCQP problems in Hilbert spaces
Ewa M. Bednarczuk, Giovanni Bruccola
We provide conditions ensuring that the KKT-type conditions characterizes the global optimality for quadratically constrained (possibly nonconvex) quadratic programming QCQP proble…
Calculus rules for proximal ε-subdifferentials and inexact proximity operators for weakly convex functions
Ewa Bednarczuk, Giovanni Bruccola, Gabriele Scrivanti +1
We investigate inexact proximity operators for weakly convex functions. To this aim, we derive sum rules for proximal ε-subdifferentials, by incorporating the moduli of weak convex…
Finding global solutions for a class of possibly nonconvex QCQP problems through the S-lemma
Ewa M. Bednarczuk, Giovanni Bruccola
In this paper we provide necessary and sufficient (KKT) conditions for global optimality for a new class of possibly nonconvex quadratically constrained quadratic programming (QCQP…