Publications
DBLP − Google Scholar − Scopus
Awards
[C27]: Best talk award at the NSV 2015
[C25]: MSS best paper award at MSS 2014
[C11]: ACP best student paper at CP 2008
[C9]: ACP best research paper at CP 2008
Journals
[J32] Monnet D., Goldsztejn A., Plestan F..
Generalization of the twisting convergence conditions to non-affine systems
Automatica (Elsevier), in press, 2021.
[J31] Briot S., Goldsztejn A..
Singularity Conditions for Continuum Parallel Robots
IEEE Transactions on Robotics, early access, 2021.
[J30] Koessler A., Goldsztejn A., Briot S., Bouton N..
Dynamics-based Algorithm for Reliable Assembly Mode Tracking in Parallel Robots
IEEE Transactions on Robotics, volume 36 (3), pages 937-950, 2020.
[J29] Marendet A., Goldsztejn A., Chabert G., Jermann C..
A standard branch-and-bound approach for nonlinear semi-infinite problems
EJOR (Elsevier), volume 282, pages 438-452, 2020.
[J28] Goldsztejn A., Chabert G..
Estimating the robust domain of attraction for non-smooth systems using an interval Lyapunov equation
Automatica (Elsevier), volume 100, pages 371-377, 2019.
[J27] Briot S., Goldsztejn A..
Topology Optimization of Industrial Robots: Application to a Five-bar Mechanism
Mechanism and Machine Theory (Elsevier), volume 120, pages 30-56, 2018.
[J26] Purohit H., Goldsztejn A., Jermann C., Granvilliers L., Goualard F., Nataraj P. S. V., Patil B..
Simultaneous automated design of structured QFT controller and prefilter using nonlinear programming
International Journal of Robust Nonlinear Control (Wiley), volume 27 (15), pages 2529-2548, 2017.
(full text available on request)
[J25] Domes F., Goldsztejn A..
A branch and bound algorithm for quantified quadratic programming
Journal of Global Optimization (Springer), volume 68 (1), pages 1-22, 2017.
[J24] Goldsztejn A., Caro S., Chabert G..
A three-step methodology for dimensional tolerance synthesis
of parallel manipulators
Mechanism and Machine Theory (Elsevier), volume 105, pages 213-234, 2016.
(extended version of [C26] presented at IFToMM 2015)
[J23] Goldsztejn A., Ishii D..
A Parallelotope Method for Hybrid System Simulation
Reliable Computing (electronic edition), volume 23 (Special issue in honor of Ray Moore, 1929-2015), pages 163-185, 2016.
(extended version of [C25] presented at MSS 2014)
[J22] Martin B., Goldsztejn A., Jermann C., Granvilliers L..
Constraint propagation using dominance in interval Branch and Bound for nonlinear biobjective optimization,
European Journal of Operational Research, volume 260 (3), pages 934-948, 2017.
[J21] Ishii D., Yonezaki N., Goldsztejn A..
Monitoring Temporal Properties Using Interval Analysis,
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences, volume E99-A(2), pages 442-453, 2016.
(extended version of [C27] presented at NSV 2015)
[J20] Goldsztejn A., Jermann C., Ruiz de Angulo V., Torras C.
Variable Symmetry Breaking in Numeric Constraint Problems,
Artificial Intelligence Journal (Elsevier), volume 229, pages 105-125, 2015.
(extended version of [C21] presented at CP 2011)
[J19] Goldsztejn A., Neumaier A..
On the Exponentiation of Interval Matrices
Reliable Computing (electronic edition), volume 20, pages 52-72, 2014.
[J18] Martin, B., Goldsztejn A., Granvilliers L., Jermann C..
On continuation methods for non-linear bi-objective optimization: towards a certified interval-based approach
Journal of Global Optimization (Springer), volume 24 (1), pages 3-16, 2014.
[J17] Caro S., Chablat D., Goldsztejn A., Ishii D., Jermann C..
A Branch and Prune Algorithm for the Computation of Generalized Aspects of Parallel Robots,
Artificial Intelligence Journal (Elsevier), volume 221, pages 34-50, 2014.
(extended version of [C22] presented at CP 2012)
[J16] Martin, B., Goldsztejn A., Jermann C., Granvilliers L..
Certified Parallelotope Continuation for One-Manifolds
SIAM journal on Numerical Analysis (SIAM), volume 51 (6), pages 3373-3401, 2013.
[J15] Goldsztejn A., Cruz J., Carvalho E.
Convergence Analysis and Adaptive Strategy for the Certified Quadrature Over a Set Defined by Inequalities
Journal of Computational and Applied Mathematics (Elsevier), volume 260, pages 543-560, 2013.
[J14] Tannous M., Caro S., Goldsztejn A.
Sensitivity Analysis of Parallel Manipulators Using an Interval Linearization Method
Mechanism and Machine Theory (Elsevier), volume 71, pages 93-114, 2013.
[J13] Goldsztejn A., Domes F., Chevalier B.
First Order Rejection Tests For Multiple-Objective Optimization
Journal of Global Optimization (Springer), volume 58 (4), pages 653-672, 2014.
[J12] Goldsztejn A.,
Modal Intervals Revisited, Part 2: A Generalized Interval Mean Value Extension
Reliable Computing (electronic edition), volume 16, pages 184-209, 2012.
[J11] Goldsztejn A.,
Modal Intervals Revisited, Part 1: A Generalized Interval Natural Extension
Reliable Computing (electronic edition), volume 16, pages 130-183, 2012.
[J10] Ishii D., Goldsztejn A., Jermann C.,
Interval-Based Projection Method for Under-Constrained Numerical Systems
Constraints (Springer), volume 17 (4), pages 432-460.
[J9] Goldsztejn A., Wayne Hayes, Pieter Collins,
Tinkerbell Is Chaotic
SIAM Journal on Applied Dynamical Systems, volume 10(4), pages 1480-1501, 2011.
(extended version of [C7] presented at SCICADE 2007)
[J8] Goldsztejn A., Yahia Lebbah, Claude Michel, Rueher M.,
Capabilities of Constraint Programming in Safe Global Optimization
Reliable Computing (electronic edition), volume 15(1), pages 47-59, 2011.
[J7] Goldsztejn A., Jaulin L.,
Inner Approximation of the Range of Vector-Valued Functions
Reliable Computing (electronic edition), volume 14, pages 1-23, 2010.
[J6] Normand J.M., Goldsztejn A., Christie M., Benhamou F.,
A Branch and Bound Algorithm for Numerical MAX-CSP
Constraints (Springer), volume 15(2), pages 213-237, 2010.
(extended version of [C11] presented at CP 2008)
[J5] Goldsztejn A., Granvilliers L.,
A New Framework for Sharp and Efficient Resolution of NCSP with Manifolds of Solutions
Constraints (Springer), volume 15(2), pages 190-212, 2010.
(extended version of [C9] presented at CP 2008)
[J4] Goldsztejn A., Michel C., Rueher M.
Efficient Handling of Universally Quantified Inequalities
Constraints (Springer), volume 14(1), pages 117-135, 2009.
(extended version of [C8] presented at SAC 2008)
[J3] Chabert G., Goldsztejn A.,
Extension of Hansen-Bliek's Method to Right-Quantified Linear Systems
Reliable Computing (Springer), volume 13(4), pages 325-349, 2007.
[J2] Goldsztejn A.,
Comparison of the Hansen-Sengupta and the Frommer-Lang-Schnurr Existence Tests,
Computing (Springer), volume 79(1), pages 53-60, 2007.
[J1] Goldsztejn A.,
A Right-Preconditioning Process for the Formal-Algebraic Approach to Inner and Outer Estimation of AE-solution Set,
Reliable Computing (Springer), volume 11(6), pages 443-478, 2005.
Book Chapters
[B1] Grandon C., Goldsztejn A.,
Quantifier Elimination versus Generalized Interval Evaluation: a Comparison on a Specific Class of Quantified Constraint,
In B. Bouchon-Meunier, C. Marsala, M. Rifqi, and R.R. Yager, editors, Uncertainty and Intelligent Information Systems, chapter 36, pages 501-511. World Scientific, 2008.
(extended version of [C2] presented at IPMU 2006)
Conferences
[C29] Briot S., Goldsztejn A.,
Topology Optimization of a Reactionless Four-Bar Linkage,
CK 2017: Book chapter Springer proceedings, pages 413-421.
[C28] Adrien Koessler A., Goldsztejn A., Briot S., Bouton N.,
Certified detection of parallel robot assembly mode under Type 2 singularity crossing trajectories,
ICRA 2017: IEEE proceedings, pages 6073-6079.
[C27] Ishii D., Yonezaki N., Goldsztejn A.,
Monitoring Bounded LTL Properties Using Interval Analysis,
NSV 2015: ENTCS 317, pages 85-100..
(best talk award)
[C26] Goldsztejn A., Caro S., Chabert G..
A New Methodology for Tolerance Synthesis of Parallel Manipulators,
IFToMM 2015.
[C25] Ishii D., Goldsztejn A..
Simulation of Nonlinear Hybrid Systems using a Parallelotope Method,
MSS 2014: IEICE Technical Report, volume 113(421), pages 135-139.
(best paper award)
[C24] Salas I., Chabert G., Goldsztejn A..
The Non-Overlapping Constraint between Objects described by Non-Linear Inequalities,
CP 2014: LNCS 8656, pages 672-687.
[C23] Goldsztejn A., Granvilliers L., Jermann C..
Constraint Based Computation of Periodic Orbits of Chaotic Dynamical Systems,
CP 2013: LNCS, pages 774-789.
[C22] Caro S., Chablat D., Goldsztejn A., Ishii D., Jermann C..
A Branch and Prune Algorithm for the Computation of Generalized Aspects of Parallel Robots,
CP 2012: LNCS, pages 867-882.
[C21] Goldsztejn A., Jermann C., Ruiz de Angulo V., Torras C.
Symmetry Breaking in Numeric Constraint Problems,
CP 2011: LNCS 6876 pages 317-324.
[C20] Tannous M., Caro S., Goldsztejn A.
Sensitivity Analysis of Parallel Manipulators Using a Fixed Point Interval Iteration Method,
IFToMM 13th World Congress in Mechanism and Machine Science, 2011
[C19] Goldsztejn A., Mullier O., Eveillard D., Hosobe H.
Including Ordinary Differential Equations Based Constraints in the Standard CP Framework,
CP 2010: LNCS 6308 pages 221-235.
[C18] Berger N., Soto R., Goldsztejn A., Caro S., Cardou P.
Finding the Maximal Pose Error in Robotic Mechanical Systems Using Constraint Programming,
IEA-AIE 2010: LNAI 6096, pages 82-91.
[C17] Goldsztejn A., Goualard F.
Box Consistency through Adaptive Shaving,
SAC 2010: Proceedings of the 25th Annual ACM Symposium on Applied Computing, pages 2049-2054.
[C16] Ishii D., Ueda K., Hosobe H., Goldsztejn A.
Interval-based Solving of Hybrid Constraint Systems,
ADHS 2009: Proceedings of the 3rd IFAC Conference on Analysis and Design of Hybrid Systems, pages 144-149.
[C15] Chenouard R., Goldsztejn A., Jermann C.
Search Strategies for an Anytime Usage of the Branch and Prune Algorithm,
IJCAI 2009: Proceedings of the Twenty-first International Joint Conference on Artificial Intelligence, pages 468-473.
[C14] Goualard F., Goldsztejn A.
A Data-Parallel Algorithm to Reliably Solve Systems of Nonlinear Equations,
PDCAT 2008: Proceedings of the Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies (IEEE Computer Society Press), pages 39-46.
[C13] Collins P., Goldsztejn A.
The Reach-and-Evolve Algorithm for Reachability Analysis of Nonlinear Dynamical Systems,
WRP 2008: ENTCS 223 pages 87-102.
[C12] Rueher M., Goldsztejn A., Lebbah Y., Michel C.
Capabilities of Constraint Programming in Rigorous Global Optimization,
NOLTA 2008.
[C11] Normand J.-M., Goldsztejn A., Christie M., Benhamou F.
A Branch and Bound Algorithm for Numerical MAX-CSP,
CP 2008: LNCS 5202 pages 205-219.
(best student paper award)
(Mathematica Player - html preview)
[C10] Goldsztejn A., Lebbah Y., Michel C., Rueher M.
Revisiting the upper bounding process in a safe Branch and Bound algorithm,
CP 2008: LNCS 5202 pages 598-602 (short paper).
[C9] Goldsztejn A., Granvilliers L.
A New Framework for Sharp and Efficient Resolution of NCSP with Manifolds of Solutions,
CP 2008: LNCS 5202 pages 190-204.
(best research paper award)
[C8] Goldsztejn A., Michel C., Rueher M.
An Efficient Algorithm for a Sharp Approximation of Universally Quantified Inequalities,
SAC 2008: Proceedings of the 23rd Annual ACM Symposium on Applied Computing
[C7] Goldsztejn A., Hayes W.,
A New Containment Method For Rigorous Shadowing
SCICADE 2007: International Conference on SCIentific Computation And Differential Equations.
[C6] Goldsztejn A., Hayes W.,
Rigorous Inner Approximation of the Range of Functions
SCAN 2006: Post-proceedings of 12th GAMM – IMACS International Symposion on Scientific Computing, Computer Arithmetic and Validated Numerics.
[C5] Goldsztejn A., Chabert G.,
On the approximation of linear AE-solution sets
SCAN 2006: Post-proceedings of 12th GAMM – IMACS International Symposion on Scientific Computing, Computer Arithmetic and Validated Numerics.
[C4] Goldsztejn A., Jaulin L.,
Inner and Outer Approximations of Existentially Quantified Equality Constraints,
CP 2006: LNCS 4204 pages 198-212.
[C3] Goldsztejn A., Chabert G.
A Generalized Interval LU Decomposition for the Solution of Interval Linear Systems,
NMA 2006: LNCS 4310 pages 312-319.
[C2] Grandon C., Goldsztejn A.,
Quantifier Elimination versus Generalized Interval Evaluation: a Comparison on a Specific Class of Quantified Constraint,
IPMU 2006: Proceedings of the 11th International
Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems.
(extended version of [P1] presented at SAC 2006)
[C1] Goldsztejn A.,
A branch and prune algorithm for the approximation of non-linear AE-solution sets,
SAC 2006: Proceedings of the 21st Annual ACM Symposium on Applied Computing.
Posters
[P1] Grandon C., Goldsztejn A.,
Inner approximation of distance constraints with existential quantification of parameters,
SAC '06: Proceedings pages 1660--1661.
(poster) (short paper)
Workshops with full paper reviewing process
[W2] Goldsztejn A., Daney D., Rueher M., Taillibert P.,
Modal intervals revisited: a mean-value extension to generalized intervals,
QCP 2005: First International Workshop on Quantification in Constraint Programming (held in conjunction with CP 2005).
[W1] Goldsztejn A.,
Verified Projection of the Solution Set of Parametric Real Systems,
COCOS 2003: 2nd International Workshop on Global Constrained Optimization and Constraint Satisfaction.
Research reports
Goldsztejn A.,
On the Exponentiation of Interval Matrices
HAL report number hal-00411330.
Goldsztejn A.,
Sensitivity Analysis Using a Fixed Point Interval Iteration
HAL report number hal-00339377.
Goldsztejn A.,
Modal Intervals Revisited Part I: A Generalized Interval Natural Extension
HAL report number hal-00294219.
Goldsztejn A.,
Modal Intervals Revisited Part II: A Generalized Interval Mean-Value Extension
HAL report number hal-00294222.
Goldsztejn A.,
Manifold approximation of set-valued functions
HAL report number hal-00350447.
Ph.D. Thesis
[PhD] Goldsztejn A.,
Définition et Applications des Extensions des Fonctions Réelles aux Intervalles Généralisés: Nouvelle Formulation de la Théorie des Intervalles Modaux et Nouveaux Résultats,
PhD thesis, University of Nice Sophia Antipolis, 2005.
Also available at Edition Universitaires Européennes.