Alexandre Goldsztejn

Orcid: 0000-0002-6561-5888

According to our database1, Alexandre Goldsztejn authored at least 60 papers between 2005 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Determination of All Stable and Unstable Equilibria for Image-Point-Based Visual Servoing.
IEEE Trans. Robotics, 2024

Estimating the robust domain of attraction for difference inclusions using an interval Lyapunov equation.
Syst. Control. Lett., 2024

2023
An equioscillation theorem for multivariate Chebyshev approximation.
CoRR, 2023

2022
Hardware-Aware Design of Multiplierless Second-Order IIR Filters With Minimum Adders.
IEEE Trans. Signal Process., 2022

Singularity Conditions for Continuum Parallel Robots.
IEEE Trans. Robotics, 2022

Computer algebra methods for polynomial system solving at the service of image-based visual servoing.
ACM Commun. Comput. Algebra, 2022

Generalization of the twisting convergence conditions to non-affine systems.
Autom., 2022

New convergence conditions for the super twisting algorithm with uncertain input gain.
Autom., 2022

Second order sliding mode twisting controller tuning based on two-level optimization process.
Proceedings of the 61st IEEE Conference on Decision and Control, 2022

Practical stability and attractors of systems with bounded perturbations.
Proceedings of the 61st IEEE Conference on Decision and Control, 2022

2020
Dynamics-Based Algorithm for Reliable Assembly Mode Tracking in Parallel Robots.
IEEE Trans. Robotics, 2020

A standard branch-and-bound approach for nonlinear semi-infinite problems.
Eur. J. Oper. Res., 2020

R-Min: a Fast Collaborative Underactuated Parallel Robot for Pick-and-Place Operations.
Proceedings of the 2020 IEEE International Conference on Robotics and Automation, 2020

Towards a Generic Interval Solver for Differential-Algebraic CSP.
Proceedings of the Principles and Practice of Constraint Programming, 2020

2019
Estimating the robust domain of attraction for non-smooth systems using an interval Lyapunov equation.
Autom., 2019

2017
A branch and bound algorithm for quantified quadratic programming.
J. Glob. Optim., 2017

Constraint propagation using dominance in interval Branch & Bound for nonlinear biobjective optimization.
Eur. J. Oper. Res., 2017

HySIA: Tool for Simulating and Monitoring Hybrid Automata Based on Interval Analysis.
Proceedings of the Runtime Verification - 17th International Conference, 2017

Certified detection of parallel robot assembly mode under Type 2 singularity crossing trajectories.
Proceedings of the 2017 IEEE International Conference on Robotics and Automation, 2017

Reliable Simulation and Monitoring of Hybrid Systems Based on Interval Analysis - (Extended Abstract).
Proceedings of the Cyber Physical Systems. Design, Modeling, and Evaluation, 2017

2016
On continuation methods for non-linear bi-objective optimization: towards a certified interval-based approach.
J. Glob. Optim., 2016

Monitoring Temporal Properties Using Interval Analysis.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016

2015
Monitoring Bounded LTL Properties Using Interval Analysis.
Proceedings of the Seventh and Eighth International Workshops on Numerical Software Verification, 2015

Variable symmetry breaking in numerical constraint problems.
Artif. Intell., 2015

2014
On the Exponentiation of Interval Matrices.
Reliab. Comput., 2014

First order rejection tests for multiple-objective optimization.
J. Glob. Optim., 2014

Convergence analysis and adaptive strategy for the certified quadrature over a set defined by inequalities.
J. Comput. Appl. Math., 2014

A branch and prune algorithm for the computation of generalized aspects of parallel robots.
Artif. Intell., 2014

The Non-overlapping Constraint between Objects Described by Non-linear Inequalities.
Proceedings of the Principles and Practice of Constraint Programming, 2014

2013
Certified Parallelotope Continuation for One-Manifolds.
SIAM J. Numer. Anal., 2013

Constraint Based Computation of Periodic Orbits of Chaotic Dynamical Systems.
Proceedings of the Principles and Practice of Constraint Programming, 2013

2012
Modal Intervals Revisited, Part 2: A Generalized Interval Mean Value Extension.
Reliab. Comput., 2012

Modal Intervals Revisited, Part 1: A Generalized Interval Natural Extension.
Reliab. Comput., 2012

Interval-based projection method for under-constrained numerical systems.
Constraints An Int. J., 2012

2011
Tinkerbell Is Chaotic.
SIAM J. Appl. Dyn. Syst., 2011

Capabilities of Constraint Programming in Safe Global Optimization.
Reliab. Comput., 2011

Symmetry Breaking in Numeric Constraint Problems.
Proceedings of the Principles and Practice of Constraint Programming - CP 2011, 2011

2010
Inner Approximation of the Range of Vector-Valued Functions.
Reliab. Comput., 2010

A branch and bound algorithm for numerical Max-CSP.
Constraints An Int. J., 2010

A new framework for sharp and efficient resolution of NCSP with manifolds of solutions.
Constraints An Int. J., 2010

Box consistency through adaptive shaving.
Proceedings of the 2010 ACM Symposium on Applied Computing (SAC), 2010

Finding the Maximal Pose Error in Robotic Mechanical Systems Using Constraint Programming.
Proceedings of the Trends in Applied Intelligent Systems, 2010

Including Ordinary Differential Equations Based Constraints in the Standard CP Framework.
Proceedings of the Principles and Practice of Constraint Programming - CP 2010, 2010

2009
On the Exponentiation of Interval Matrices
CoRR, 2009

Efficient handling of universally quantified inequalities.
Constraints An Int. J., 2009

Search Strategies for an Anytime Usage of the Branch and Prune Algorithm.
Proceedings of the IJCAI 2009, 2009

Interval-based Solving of Hybrid Constraint Systems.
Proceedings of the 3rd IFAC Conference on Analysis and Design of Hybrid Systems, 2009

2008
The Reach-and-Evolve Algorithm for Reachability Analysis of Nonlinear Dynamical Systems.
Proceedings of the Second Workshop on Reachability Problems in Computational Models, 2008

Sensitivity Analysis Using a Fixed Point Interval Iteration
CoRR, 2008

An efficient algorithm for a sharp approximation of universally quantified inequalities.
Proceedings of the 2008 ACM Symposium on Applied Computing (SAC), 2008

A Data-Parallel Algorithm to Reliably Solve Systems of Nonlinear Equations.
Proceedings of the Ninth International Conference on Parallel and Distributed Computing, 2008

Revisiting the Upper Bounding Process in a Safe Branch and Bound Algorithm.
Proceedings of the Principles and Practice of Constraint Programming, 2008

2007
Extension of the Hansen-Bliek Method to Right-Quantified Linear Systems.
Reliab. Comput., 2007

Comparison of the Hansen-Sengupta and the Frommer-Lang-Schnurr existence tests.
Computing, 2007

2006
Inner approximation of distance constraints with existential quantification of parameters.
Proceedings of the 2006 ACM Symposium on Applied Computing (SAC), 2006

A branch and prune algorithm for the approximation of non-linear AE-solution sets.
Proceedings of the 2006 ACM Symposium on Applied Computing (SAC), 2006

A Generalized Interval LU Decomposition for the Solution of Interval Linear Systems.
Proceedings of the Numerical Methods and Applications, 6th International Conference, 2006

Inner and Outer Approximations of Existentially Quantified Equality Constraints.
Proceedings of the Principles and Practice of Constraint Programming, 2006

2005
Definition et Applications des Extensions desFonctions Reelles aux Intervalles Généralisés; reformulation de la theorie des intervalles modaux.
PhD thesis, 2005

A Right-Preconditioning Process for the Formal-Algebraic Approach to Inner and Outer Estimation of AE-Solution Sets.
Reliab. Comput., 2005


  Loading...