Adriano Pascoletti - Profile on Academia.edu (original) (raw)
Uploads
Papers by Adriano Pascoletti
On Uncalibrated
This paper presents an analytical study and several practical results for computing stable recons... more This paper presents an analytical study and several practical results for computing stable reconstructions with uncalibrated, motion-based inspection and conveyor-belt installations. We achieve metric reconstruction with a simple, efficient algorithm and two nonlinear constraints expressing knowledge readily accessible in a real setup. We analyse the stability and accuracy of reconstruction with respect to the system's mathematical structure, pixelisation, image noise, and constraint values. Extensive experiments with simulated and real data have confirmed our analysis in full, and one example is illustrated here.
Genericity and Singularities in Vector Optimization
Lecture Notes in Economics and Mathematical Systems, 1978
Let C∞ be the set of smooth maps u from X to Y, where X and Y are open smooth manifolds of dimens... more Let C∞ be the set of smooth maps u from X to Y, where X and Y are open smooth manifolds of dimension n and m respectively (for our purposes we shall take Y = Rm). Let Λ be an open convex cone in Rm with non empty interior, \(\bar \Lambda \) its closure, ∂Λ its boundary.
Comments on (quote)Cooperative games and vector-valued criteria problems(quote)
This document specifies the formatting requirements for final manuscripts that are to be publishe... more This document specifies the formatting requirements for final manuscripts that are to be published in the series CISM Courses and Lectures. It also explains how template and style files can be used. Specific instructions for the editor(s) of the volume are also included.
Journal of Optimization Theory and Applications, 1984
A scalarization of vector optimization problems is proposed, where optimality is defined through ... more A scalarization of vector optimization problems is proposed, where optimality is defined through convex cones. By varying the parameters of the scalar problem, it is possible to find all vector optima from the scalar ones. Moreover, it is shown that, under mild assumptions, the dependence is differentiable for smooth objective maps defined over reflexive Banach spaces. A sufficiency condition of optimality for a general mathematical programming problem is also given in the Appendix.
Journal of Mathematical Analysis and Applications, 1982
Information Processing Letters, 1987
Heavy ion irradiation effects on magnetic field dependent rf losses in Bi2212 single crystals
Information Processing Letters, 1992
Journal of Optimization Theory and Applications, 2007
We deal with differential conditions for local optimality. The conditions we derive for inequalit... more We deal with differential conditions for local optimality. The conditions we derive for inequality constrained problems do not require constraint qualifications and are the broadest conditions based only on first and second order derivatives. A similar result is proved for equality constrained problems, although necessary conditions require regularity of the equality constraints.
On Uncalibrated
This paper presents an analytical study and several practical results for computing stable recons... more This paper presents an analytical study and several practical results for computing stable reconstructions with uncalibrated, motion-based inspection and conveyor-belt installations. We achieve metric reconstruction with a simple, efficient algorithm and two nonlinear constraints expressing knowledge readily accessible in a real setup. We analyse the stability and accuracy of reconstruction with respect to the system's mathematical structure, pixelisation, image noise, and constraint values. Extensive experiments with simulated and real data have confirmed our analysis in full, and one example is illustrated here.
Genericity and Singularities in Vector Optimization
Lecture Notes in Economics and Mathematical Systems, 1978
Let C∞ be the set of smooth maps u from X to Y, where X and Y are open smooth manifolds of dimens... more Let C∞ be the set of smooth maps u from X to Y, where X and Y are open smooth manifolds of dimension n and m respectively (for our purposes we shall take Y = Rm). Let Λ be an open convex cone in Rm with non empty interior, \(\bar \Lambda \) its closure, ∂Λ its boundary.
Comments on (quote)Cooperative games and vector-valued criteria problems(quote)
This document specifies the formatting requirements for final manuscripts that are to be publishe... more This document specifies the formatting requirements for final manuscripts that are to be published in the series CISM Courses and Lectures. It also explains how template and style files can be used. Specific instructions for the editor(s) of the volume are also included.
Journal of Optimization Theory and Applications, 1984
A scalarization of vector optimization problems is proposed, where optimality is defined through ... more A scalarization of vector optimization problems is proposed, where optimality is defined through convex cones. By varying the parameters of the scalar problem, it is possible to find all vector optima from the scalar ones. Moreover, it is shown that, under mild assumptions, the dependence is differentiable for smooth objective maps defined over reflexive Banach spaces. A sufficiency condition of optimality for a general mathematical programming problem is also given in the Appendix.
Journal of Mathematical Analysis and Applications, 1982
Information Processing Letters, 1987
Heavy ion irradiation effects on magnetic field dependent rf losses in Bi2212 single crystals
Information Processing Letters, 1992
Journal of Optimization Theory and Applications, 2007
We deal with differential conditions for local optimality. The conditions we derive for inequalit... more We deal with differential conditions for local optimality. The conditions we derive for inequality constrained problems do not require constraint qualifications and are the broadest conditions based only on first and second order derivatives. A similar result is proved for equality constrained problems, although necessary conditions require regularity of the equality constraints.