default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexandre Goldsztejn
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j33]Chaolun Lu
, Alexandre Goldsztejn, Yongqiang Li:
Estimating the robust domain of attraction for difference inclusions using an interval Lyapunov equation. Syst. Control. Lett. 193: 105911 (2024)- [j32]Chaolun Lu, Yongqiang Li, Alexandre Goldsztejn, Zhongsheng Hou, Yu Feng, Yuanjing Feng:
Discrete-Time General Nonlinear Robust Control: Stabilization With Closed-Loop Robust DOA Enlargement Based on Interval Analysis. IEEE Trans. Circuits Syst. I Regul. Pap. 71(12): 5720-5733 (2024) - [j31]Alessandro Colotti, Jorge García Fontán, Alexandre Goldsztejn, Sébastien Briot, François Chaumette, Olivier Kermorgant, Mohab Safey El Din:
Determination of All Stable and Unstable Equilibria for Image-Point-Based Visual Servoing. IEEE Trans. Robotics 40: 3406-3424 (2024) - 2023
- [i10]Alexandre Goldsztejn:
An equioscillation theorem for multivariate Chebyshev approximation. CoRR abs/2310.01851 (2023) - 2022
- [j30]Dominique Monnet, Alexandre Goldsztejn, Franck Plestan:
Generalization of the twisting convergence conditions to non-affine systems. Autom. 137: 110019 (2022) - [j29]Alessandro Colotti, Dominique Monnet, Alexandre Goldsztejn, Franck Plestan:
New convergence conditions for the super twisting algorithm with uncertain input gain. Autom. 143: 110423 (2022) - [j28]Jorge García Fontán, Alessandro Colotti, Sébastien Briot, Alexandre Goldsztejn, Mohab Safey El Din:
Computer algebra methods for polynomial system solving at the service of image-based visual servoing. ACM Commun. Comput. Algebra 56(2): 36-40 (2022) - [j27]Sébastien Briot, Alexandre Goldsztejn:
Singularity Conditions for Continuum Parallel Robots. IEEE Trans. Robotics 38(1): 507-525 (2022) - [j26]Rémi Garcia, Anastasia Volkova, Martin Kumm, Alexandre Goldsztejn, Jonas Kühle:
Hardware-Aware Design of Multiplierless Second-Order IIR Filters With Minimum Adders. IEEE Trans. Signal Process. 70: 1673-1686 (2022) - [c27]Alessandro Colotti, Alexandre Goldsztejn:
Practical stability and attractors of systems with bounded perturbations. CDC 2022: 5129-5134 - [c26]Dominique Monnet, Alexandre Goldsztejn, Franck Plestan, Charles Audet:
Second order sliding mode twisting controller tuning based on two-level optimization process. CDC 2022: 6830-6835 - 2021
- [i9]Rémi Garcia, Anastasia Volkova, Martin Kumm, Alexandre Goldsztejn, Jonas Kühle:
Hardware-aware Design of Multiplierless Second-Order IIR Filters with Minimum Adders. CoRR abs/2108.01565 (2021) - 2020
- [j25]Antoine Marendet, Alexandre Goldsztejn, Gilles Chabert, Christophe Jermann:
A standard branch-and-bound approach for nonlinear semi-infinite problems. Eur. J. Oper. Res. 282(2): 438-452 (2020) - [j24]Adrien Koessler, Alexandre Goldsztejn, Sébastien Briot, Nicolas Bouton:
Dynamics-Based Algorithm for Reliable Assembly Mode Tracking in Parallel Robots. IEEE Trans. Robotics 36(3): 937-950 (2020) - [c25]Simon Rohou, Abderahmane Bedouhene, Gilles Chabert, Alexandre Goldsztejn, Luc Jaulin, Bertrand Neveu, Victor Reyes, Gilles Trombettoni:
Towards a Generic Interval Solver for Differential-Algebraic CSP. CP 2020: 548-565 - [c24]Guillaume Jeanneau, Vincent Bégoc, Sébastien Briot, Alexandre Goldsztejn:
R-Min: a Fast Collaborative Underactuated Parallel Robot for Pick-and-Place Operations. ICRA 2020: 10365-10371
2010 – 2019
- 2019
- [j23]Alexandre Goldsztejn, Gilles Chabert:
Estimating the robust domain of attraction for non-smooth systems using an interval Lyapunov equation. Autom. 100: 371-377 (2019) - 2017
- [j22]Benjamin Martin, Alexandre Goldsztejn, Laurent Granvilliers, Christophe Jermann:
Constraint propagation using dominance in interval Branch & Bound for nonlinear biobjective optimization. Eur. J. Oper. Res. 260(3): 934-948 (2017) - [j21]Ferenc Domes, Alexandre Goldsztejn:
A branch and bound algorithm for quantified quadratic programming. J. Glob. Optim. 68(1): 1-22 (2017) - [c23]Daisuke Ishii, Alexandre Goldsztejn, Naoki Yonezaki:
Reliable Simulation and Monitoring of Hybrid Systems Based on Interval Analysis - (Extended Abstract). CyPhy 2017: 79-82 - [c22]Adrien Koessler, Alexandre Goldsztejn, Sébastien Briot, Nicolas Bouton:
Certified detection of parallel robot assembly mode under Type 2 singularity crossing trajectories. ICRA 2017: 6073-6079 - [c21]Daisuke Ishii, Alexandre Goldsztejn:
HySIA: Tool for Simulating and Monitoring Hybrid Automata Based on Interval Analysis. RV 2017: 370-379 - [i8]Daisuke Ishii, Alexandre Goldsztejn:
HySIA: Tool for Simulating and Monitoring Hybrid Automata Based on Interval Analysis. CoRR abs/1712.00570 (2017) - 2016
- [j20]Daisuke Ishii, Naoki Yonezaki, Alexandre Goldsztejn:
Monitoring Temporal Properties Using Interval Analysis. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 99-A(2): 442-453 (2016) - [j19]Benjamin Martin, Alexandre Goldsztejn, Laurent Granvilliers, Christophe Jermann:
On continuation methods for non-linear bi-objective optimization: towards a certified interval-based approach. J. Glob. Optim. 64(1): 3-16 (2016) - [i7]Daisuke Ishii, Naoki Yonezaki, Alexandre Goldsztejn:
Monitoring Temporal Properties using Interval Analysis. CoRR abs/1602.02387 (2016) - 2015
- [j18]Alexandre Goldsztejn, Christophe Jermann, Vicente Ruiz de Angulo, Carme Torras:
Variable symmetry breaking in numerical constraint problems. Artif. Intell. 229: 105-125 (2015) - [c20]Daisuke Ishii, Naoki Yonezaki, Alexandre Goldsztejn:
Monitoring Bounded LTL Properties Using Interval Analysis. NSV 2015: 85-100 - [i6]Daisuke Ishii, Naoki Yonezaki, Alexandre Goldsztejn:
Monitoring Bounded LTL Properties Using Interval Analysis. CoRR abs/1506.01762 (2015) - 2014
- [j17]Stéphane Caro, Damien Chablat, Alexandre Goldsztejn, Daisuke Ishii, Christophe Jermann:
A branch and prune algorithm for the computation of generalized aspects of parallel robots. Artif. Intell. 211: 34-50 (2014) - [j16]Alexandre Goldsztejn, Jorge Cruz, Elsa Carvalho:
Convergence analysis and adaptive strategy for the certified quadrature over a set defined by inequalities. J. Comput. Appl. Math. 260: 543-560 (2014) - [j15]Alexandre Goldsztejn, Ferenc Domes, Brice Chevalier:
First order rejection tests for multiple-objective optimization. J. Glob. Optim. 58(4): 653-672 (2014) - [j14]Alexandre Goldsztejn, Arnold Neumaier:
On the Exponentiation of Interval Matrices. Reliab. Comput. 20: 53-72 (2014) - [c19]Ignacio Salas, Gilles Chabert, Alexandre Goldsztejn:
The Non-overlapping Constraint between Objects Described by Non-linear Inequalities. CP 2014: 672-687 - 2013
- [j13]Benjamin Martin, Alexandre Goldsztejn, Laurent Granvilliers, Christophe Jermann:
Certified Parallelotope Continuation for One-Manifolds. SIAM J. Numer. Anal. 51(6): 3373-3401 (2013) - [c18]Alexandre Goldsztejn, Laurent Granvilliers, Christophe Jermann:
Constraint Based Computation of Periodic Orbits of Chaotic Dynamical Systems. CP 2013: 774-789 - 2012
- [j12]Daisuke Ishii, Alexandre Goldsztejn, Christophe Jermann:
Interval-based projection method for under-constrained numerical systems. Constraints An Int. J. 17(4): 432-460 (2012) - [j11]Alexandre Goldsztejn:
Modal Intervals Revisited, Part 1: A Generalized Interval Natural Extension. Reliab. Comput. 16: 130-183 (2012) - [j10]Alexandre Goldsztejn:
Modal Intervals Revisited, Part 2: A Generalized Interval Mean Value Extension. Reliab. Comput. 16: 184-209 (2012) - [c17]Stéphane Caro, Damien Chablat, Alexandre Goldsztejn, Daisuke Ishii, Christophe Jermann:
A Branch and Prune Algorithm for the Computation of Generalized Aspects of Parallel Robots. CP 2012: 867-882 - 2011
- [j9]Alexandre Goldsztejn, Yahia Lebbah, Claude Michel, Michel Rueher:
Capabilities of Constraint Programming in Safe Global Optimization. Reliab. Comput. 15(1): 47-59 (2011) - [j8]Alexandre Goldsztejn, Wayne B. Hayes, Pieter Collins:
Tinkerbell Is Chaotic. SIAM J. Appl. Dyn. Syst. 10(4): 1480-1501 (2011) - [c16]Alexandre Goldsztejn, Christophe Jermann, Vicente Ruiz de Angulo, Carme Torras:
Symmetry Breaking in Numeric Constraint Problems. CP 2011: 317-324 - 2010
- [j7]Alexandre Goldsztejn, Laurent Granvilliers:
A new framework for sharp and efficient resolution of NCSP with manifolds of solutions. Constraints An Int. J. 15(2): 190-212 (2010) - [j6]Jean-Marie Normand, Alexandre Goldsztejn, Marc Christie, Frédéric Benhamou:
A branch and bound algorithm for numerical Max-CSP. Constraints An Int. J. 15(2): 213-237 (2010) - [j5]Alexandre Goldsztejn, Luc Jaulin:
Inner Approximation of the Range of Vector-Valued Functions. Reliab. Comput. 14: 1-23 (2010) - [c15]Alexandre Goldsztejn, Olivier Mullier, Damien Eveillard, Hiroshi Hosobe:
Including Ordinary Differential Equations Based Constraints in the Standard CP Framework. CP 2010: 221-235 - [c14]Nicolas Berger, Ricardo Soto, Alexandre Goldsztejn, Stéphane Caro, Philippe Cardou:
Finding the Maximal Pose Error in Robotic Mechanical Systems Using Constraint Programming. IEA/AIE (1) 2010: 82-91 - [c13]Alexandre Goldsztejn, Frédéric Goualard:
Box consistency through adaptive shaving. SAC 2010: 2049-2054
2000 – 2009
- 2009
- [j4]Alexandre Goldsztejn, Claude Michel, Michel Rueher:
Efficient handling of universally quantified inequalities. Constraints An Int. J. 14(1): 117-135 (2009) - [c12]Daisuke Ishii, Kazunori Ueda, Hiroshi Hosobe, Alexandre Goldsztejn:
Interval-based Solving of Hybrid Constraint Systems. ADHS 2009: 144-149 - [c11]Raphaël Chenouard, Alexandre Goldsztejn, Christophe Jermann:
Search Strategies for an Anytime Usage of the Branch and Prune Algorithm. IJCAI 2009: 468-473 - [i5]Alexandre Goldsztejn:
On the Exponentiation of Interval Matrices. CoRR abs/0908.3954 (2009) - 2008
- [c10]Alexandre Goldsztejn, Laurent Granvilliers:
A New Framework for Sharp and Efficient Resolution of NCSP with Manifolds of Solutions. CP 2008: 190-204 - [c9]Jean-Marie Normand, Alexandre Goldsztejn, Marc Christie, Frédéric Benhamou:
A Branch and Bound Algorithm for Numerical MAX-CSP. CP 2008: 205-219 - [c8]Alexandre Goldsztejn, Yahia Lebbah, Claude Michel, Michel Rueher:
Revisiting the Upper Bounding Process in a Safe Branch and Bound Algorithm. CP 2008: 598-602 - [c7]Frédéric Goualard, Alexandre Goldsztejn:
A Data-Parallel Algorithm to Reliably Solve Systems of Nonlinear Equations. PDCAT 2008: 39-46 - [c6]Alexandre Goldsztejn, Claude Michel, Michel Rueher:
An efficient algorithm for a sharp approximation of universally quantified inequalities. SAC 2008: 134-139 - [c5]Pieter Collins, Alexandre Goldsztejn:
The Reach-and-Evolve Algorithm for Reachability Analysis of Nonlinear Dynamical Systems. RP 2008: 87-102 - [i4]Frédéric Goualard, Alexandre Goldsztejn:
A Data-Parallel Algorithm to Reliably Solve Systems of Nonlinear Equations. CoRR abs/0806.2548 (2008) - [i3]Alexandre Goldsztejn, Claude Michel, Michel Rueher:
An Efficient Algorithm for a Sharp Approximation of Universally Quantified Inequalities. CoRR abs/0807.2269 (2008) - [i2]Alexandre Goldsztejn, Yahia Lebbah, Claude Michel, Michel Rueher:
Revisiting the upper bounding process in a safe Branch and Bound algorithm. CoRR abs/0807.2382 (2008) - [i1]Alexandre Goldsztejn:
Sensitivity Analysis Using a Fixed Point Interval Iteration. CoRR abs/0811.2984 (2008) - 2007
- [j3]Alexandre Goldsztejn:
Comparison of the Hansen-Sengupta and the Frommer-Lang-Schnurr existence tests. Computing 79(1): 53-60 (2007) - [j2]Gilles Chabert, Alexandre Goldsztejn:
Extension of the Hansen-Bliek Method to Right-Quantified Linear Systems. Reliab. Comput. 13(4): 325-349 (2007) - 2006
- [c4]Alexandre Goldsztejn, Luc Jaulin:
Inner and Outer Approximations of Existentially Quantified Equality Constraints. CP 2006: 198-212 - [c3]Alexandre Goldsztejn, Gilles Chabert:
A Generalized Interval LU Decomposition for the Solution of Interval Linear Systems. Numerical Methods and Applications 2006: 312-319 - [c2]Alexandre Goldsztejn:
A branch and prune algorithm for the approximation of non-linear AE-solution sets. SAC 2006: 1650-1654 - [c1]Carlos Grandón, Alexandre Goldsztejn:
Inner approximation of distance constraints with existential quantification of parameters. SAC 2006: 1660-1661 - 2005
- [b1]Alexandre Goldsztejn:
Definition et Applications des Extensions desFonctions Reelles aux Intervalles Généralisés; reformulation de la theorie des intervalles modaux. University of Nice Sophia Antipolis, France, 2005 - [j1]Alexandre Goldsztejn:
A Right-Preconditioning Process for the Formal-Algebraic Approach to Inner and Outer Estimation of AE-Solution Sets. Reliab. Comput. 11(6): 443-478 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 22:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
