default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArnold Neumaier
Person information
- affiliation: University of Vienna, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j81]Morteza Kimiaei
, Arnold Neumaier:
Effective matrix adaptation strategy for noisy derivative-free optimization. Math. Program. Comput. 16(3): 459-501 (2024)- [j80]Arnold Neumaier, Morteza Kimiaei:
An improvement of the Goldstein line search. Optim. Lett. 18(6): 1313-1333 (2024) - 2023
- [j79]Morteza Kimiaei, Arnold Neumaier, Parvaneh Faramarzi:
New Subspace Method for Unconstrained Derivative-Free Optimization. ACM Trans. Math. Softw. 49(4): 39:1-39:28 (2023) - 2022
- [j78]Arnold Neumaier, Safet Penjic:
On Bounding the Diameter of a Distance-Regular Graph. Comb. 42(2): 237-251 (2022) - [j77]Arnold Neumaier, Safet Penjic:
A unified view of inequalities for distance-regular graphs, part I. J. Comb. Theory B 154: 392-439 (2022) - [j76]Morteza Kimiaei, Arnold Neumaier, Behzad Azmi:
LMBOPT: a limited memory method for bound-constrained optimization. Math. Program. Comput. 14(2): 271-318 (2022) - [j75]Morteza Kimiaei, Arnold Neumaier:
Efficient unconstrained black box optimization. Math. Program. Comput. 14(2): 365-414 (2022) - [j74]Morteza Kimiaei, Arnold Neumaier:
A new limited memory method for unconstrained nonlinear least squares. Soft Comput. 26(2): 465-490 (2022) - 2021
- [j73]Ali Baharev, Hermann Schichl, Arnold Neumaier, Tobias Achterberg:
An Exact Method for the Minimum Feedback Arc Set Problem. ACM J. Exp. Algorithmics 26: 1.4:1-1.4:28 (2021)
2010 – 2019
- 2019
- [j72]Tiago Montanher, Arnold Neumaier, Mihály Csaba Markót, Ferenc Domes, Hermann Schichl:
Rigorous packing of unit squares into a circle. J. Glob. Optim. 73(3): 547-565 (2019) - [j71]Ali Baharev, Arnold Neumaier, Hermann Schichl:
A manifold-based approach to sparse global constraint satisfaction problems. J. Glob. Optim. 75(4): 949-971 (2019) - 2018
- [j70]Waltraud Huyer, Arnold Neumaier:
MINQ8: general definite and bound constrained indefinite quadratic programming. Comput. Optim. Appl. 69(2): 351-381 (2018) - [j69]Tiago Montanher, Arnold Neumaier, Ferenc Domes:
A computational study of global optimization solvers on two trust region subproblems. J. Glob. Optim. 71(4): 915-934 (2018) - 2017
- [j68]Arnold Neumaier:
Bounding basis reduction properties. Des. Codes Cryptogr. 84(1-2): 237-259 (2017) - [j67]Hannes Fendl, Arnold Neumaier, Hermann Schichl:
Certificates of infeasibility via nonsmooth optimization. J. Glob. Optim. 69(1): 157-182 (2017) - [j66]Masoud Ahookhosh, Arnold Neumaier:
An optimal subgradient algorithm for large-scale bound-constrained convex optimization. Math. Methods Oper. Res. 86(1): 123-147 (2017) - [j65]Ali Baharev, Ferenc Domes, Arnold Neumaier:
A robust approach for finding all well-separated solutions of sparse systems of nonlinear equations. Numer. Algorithms 76(1): 163-189 (2017) - [j64]Masoud Ahookhosh, Arnold Neumaier:
Optimal subgradient algorithms for large-scale convex optimization in simple domains. Numer. Algorithms 76(4): 1071-1097 (2017) - [c12]Ali Baharev, Arnold Neumaier, Hermann Schichl:
Failure Modes of Tearing and a Novel Robust Approach. Modelica 2017: 132:039 - 2016
- [j63]Tanveer Iqbal, Arnold Neumaier:
Worst case error bounds for the solution of uncertain Poisson equations with mixed boundary conditions. J. Comput. Appl. Math. 303: 40-55 (2016) - [j62]Ferenc Domes, Arnold Neumaier:
Linear and parabolic relaxations for quadratic constraints. J. Glob. Optim. 65(3): 457-486 (2016) - [j61]Ferenc Domes, Arnold Neumaier:
Constraint aggregation for rigorous global optimization. Math. Program. 155(1-2): 375-401 (2016) - [j60]Arnold Neumaier:
OSGA: a fast subgradient algorithm with optimal complexity. Math. Program. 158(1-2): 1-21 (2016) - [c11]Arnold Neumaier, Damien Stehlé:
Faster LLL-type Reduction of Lattice Bases. ISSAC 2016: 373-380 - [i2]Arnold Neumaier:
Bounding basis reduction properties. IACR Cryptol. ePrint Arch. 2016: 4 (2016) - [i1]Arnold Neumaier, Damien Stehlé:
Faster LLL-type Reduction of Lattice Bases. IACR Cryptol. ePrint Arch. 2016: 852 (2016) - 2015
- [j59]Ferenc Domes, Arnold Neumaier:
Rigorous verification of feasibility. J. Glob. Optim. 61(2): 255-278 (2015) - 2014
- [j58]Hermann Schichl, Mihály Csaba Markót, Arnold Neumaier:
Exclusion regions for optimization problems. J. Glob. Optim. 59(2-3): 569-595 (2014) - [j57]Alexandre Goldsztejn, Arnold Neumaier:
On the Exponentiation of Interval Matrices. Reliab. Comput. 20: 53-72 (2014) - [j56]Balázs Bánhelyi, Tibor Csendes, Tibor Krisztin, Arnold Neumaier:
Global Attractivity of the Zero Solution for Wright's Equation. SIAM J. Appl. Dyn. Syst. 13(1): 537-563 (2014) - 2013
- [j55]Saptarshi Das, Arnold Neumaier:
Solving Overdetermined Eigenvalue Problems. SIAM J. Sci. Comput. 35(2) (2013) - [j54]Qaisra Fazal, Arnold Neumaier:
Error bounds for initial value problems by optimization. Soft Comput. 17(8): 1345-1356 (2013) - [c10]Hermann Schichl, Arnold Neumaier, Mihály Csaba Markót, Ferenc Domes:
On Solving Mixed-Integer Constraint Satisfaction Problems with Unbounded Variables. CPAIOR 2013: 216-233 - 2012
- [j53]László Pál, Tibor Csendes, Mihály Csaba Markót, Arnold Neumaier:
Black Box Optimization Benchmarking of the GLOBAL Method. Evol. Comput. 20(4): 609-639 (2012) - [j52]Ferenc Domes, Arnold Neumaier:
Rigorous filtering using linear relaxations. J. Glob. Optim. 53(3): 441-473 (2012) - [j51]Peter Schodl, Arnold Neumaier:
Continuity Notions for Multi-Valued Mappings with Possibly Disconnected Images. Reliab. Comput. 16: 84-101 (2012) - [c9]Kevin Kofler, Arnold Neumaier:
DynGenPar - A Dynamic Generalized Parser for Common Mathematical Language. AISC/MKM/Calculemus 2012: 386-401 - 2011
- [j50]Ferenc Domes, Arnold Neumaier:
Rigorous Enclosures of Ellipsoids and Directed Cholesky Factorizations. SIAM J. Matrix Anal. Appl. 32(1): 262-285 (2011) - [j49]Arnold Neumaier, Hannes Fendl, Harald Schilly, Thomas Leitner:
VXQR: derivative-free unconstrained optimization based on QR factorizations. Soft Comput. 15(11): 2287-2298 (2011) - 2010
- [j48]Ferenc Domes, Arnold Neumaier:
Constraint propagation on quadratic constraints. Constraints An Int. J. 15(3): 404-429 (2010) - [j47]Robert Fourer, Chandrakant Maheshwari, Arnold Neumaier, Dominique Orban, Hermann Schichl:
Convexity and Concavity Detection in Computational Graphs: Tree Walks for Convexity Assessment. INFORMS J. Comput. 22(1): 26-43 (2010) - [c8]Martin Fuchs, Arnold Neumaier:
Discrete Search in Design Optimization. CSDM 2010: 113-122 - [c7]Arnold Neumaier, Peter Schodl:
A Framework for Representing and Processing Arbitrary Mathematics. KEOD 2010: 476-479
2000 – 2009
- 2008
- [j46]Ferenc Domes, Arnold Neumaier:
A scaling algorithm for polynomial constraint satisfaction problems. J. Glob. Optim. 42(3): 327-345 (2008) - [j45]Waltraud Huyer, Arnold Neumaier:
SNOBFIT - Stable Noisy Optimization by Branch and Fit. ACM Trans. Math. Softw. 35(2): 9:1-9:25 (2008) - [c6]Martin Fuchs, Arnold Neumaier:
Handling Uncertainty in Higher Dimensions with Potential Clouds towards Robust Design Optimization. SMPS 2008: 376-382 - 2007
- [j44]Renee Woo, Arnold Neumaier:
On Graphs Whose Spectral Radius is Bounded by \frac32Ö2\frac{3}{2}\sqrt{2}. Graphs Comb. 23(6): 713-726 (2007) - [j43]Tamás Vinkó, Arnold Neumaier:
New bounds for Morse clusters. J. Glob. Optim. 39(4): 483-494 (2007) - [j42]Arnold Neumaier, Andrzej Pownuk:
Linear Systems with Large Uncertainties, with Applications to Truss Structures. Reliab. Comput. 13(2): 149-172 (2007) - 2006
- [j41]Hermann Schichl, Arnold Neumaier:
Transposition Theorems and Qualification-Free Optimality Conditions. SIAM J. Optim. 17(4): 1035-1055 (2006) - 2005
- [j40]Hermann Schichl, Arnold Neumaier:
Interval Analysis on Directed Acyclic Graphs for Global Optimization. J. Glob. Optim. 33(4): 541-562 (2005) - [j39]Arnold Neumaier, Oleg Shcherbina, Waltraud Huyer, Tamás Vinkó:
A comparison of complete global optimization solvers. Math. Program. 103(2): 335-356 (2005) - [e2]Christophe Jermann, Arnold Neumaier, Djamila Sam-Haroud:
Global Optimization and Constraint Satisfaction, Second International Workshop, COCOS 2003, Lausanne, Switzerland, November 18-21, 2003, Revised Selected Papers. Lecture Notes in Computer Science 3478, Springer 2005, ISBN 3-540-26003-X [contents] - 2004
- [j38]Arnold Neumaier:
Dual polar spaces as extremal distance-regular graphs. Eur. J. Comb. 25(2): 269-274 (2004) - [j37]Arnold Neumaier, Oleg Shcherbina:
Safe bounds in linear and mixed-integer linear programming. Math. Program. 99(2): 283-296 (2004) - [j36]Waltraud Huyer, Arnold Neumaier:
Integral Approximation of Rays and Verification of Feasibility. Reliab. Comput. 10(3): 195-207 (2004) - [j35]Arnold Neumaier:
Clouds, Fuzzy Sets, and Probability Intervals. Reliab. Comput. 10(4): 249-272 (2004) - [j34]Hermann Schichl, Arnold Neumaier:
Exclusion Regions for Systems of Equations. SIAM J. Numer. Anal. 42(1): 383-408 (2004) - [c5]David Daney, Yves Papegay, Arnold Neumaier:
Interval Methods for Certification of the Kinematic Calibration of Parallel Robots. ICRA 2004: 1913-1918 - 2003
- [j33]Arnold Neumaier:
Fuzzy modeling in terms of surprise. Fuzzy Sets Syst. 135(1): 21-38 (2003) - [j32]Arnold Neumaier:
Rational Functions with Prescribed Global and Local Minimizers. J. Glob. Optim. 25(2): 175-181 (2003) - [j31]Arnold Neumaier:
Taylor Forms--Use and Limits. Reliab. Comput. 9(1): 43-79 (2003) - [j30]Waltraud Huyer, Arnold Neumaier:
A New Exact Penalty Function. SIAM J. Optim. 13(4): 1141-1158 (2003) - [e1]Christian Bliek, Christophe Jermann, Arnold Neumaier:
Global Optimization and Constraint Satisfaction, First International Workshop Global Constraint Optimization and Constraint Satisfaction, COCOS 2002, Valbonne-Sophia Antipolis, France, October 2-4, 2002, Revised Selected Papers. Lecture Notes in Computer Science 2861, Springer 2003, ISBN 3-540-20463-6 [contents] - 2002
- [j29]Arnold Neumaier:
Grand Challenges and Scientific Standards in Interval Analysis. Reliab. Comput. 8(4): 313-320 (2002) - [c4]Oleg Shcherbina, Arnold Neumaier, Djamila Sam-Haroud, Xuan-Ha Vu, Tuan-Viet Nguyen:
Benchmarking Global Optimization and Constraint Satisfaction Codes. COCOS 2002: 211-222 - [c3]Jorge Santos, Weldon A. Lodwick, Arnold Neumaier:
A New Approach to Incorporate Uncertainty in Terrain Modeling. GIScience 2002: 291-299 - 2001
- [b1]Arnold Neumaier:
Introduction to Numerical Analysis. Cambridge University Press 2001, ISBN 978-0-521-33610-9, pp. I-VIII, 1-356 - [j28]Hermann Schichl, Stefan Dallwig, Arnold Neumaier:
The NOP-2 Modeling Language for Nonlinear Programming. Ann. Oper. Res. 104(1-4): 281-312 (2001) - [j27]Arnold Neumaier, Tapio Schneider:
Estimation of parameters and eigenmodes of multivariate autoregressive models. ACM Trans. Math. Softw. 27(1): 27-57 (2001) - [j26]Tapio Schneider, Arnold Neumaier:
Algorithm 808: ARfit - a matlab package for the estimation of parameters and eigenmodes of multivariate autoregressive models. ACM Trans. Math. Softw. 27(1): 58-65 (2001) - [c2]Weldon A. Lodwick, Arnold Neumaier, Francis Newman:
Optimization Under Uncertainty: Methods and Applications in Radiation Therapy. FUZZ-IEEE 2001: 1219-1222 - 2000
- [j25]Arnold Neumaier:
On Shary's Algebraic Approach for Linear Interval Equations. SIAM J. Matrix Anal. Appl. 21(4): 1156-1162 (2000) - [j24]R. Baker Kearfott, Jianwei Dian, Arnold Neumaier:
Existence Verification for Singular Zeros of Complex Nonlinear Systems. SIAM J. Numer. Anal. 38(2): 360-379 (2000)
1990 – 1999
- 1999
- [j23]Waltraud Huyer, Arnold Neumaier:
Global Optimization by Multilevel Coordinate Search. J. Glob. Optim. 14(4): 331-355 (1999) - [j22]Arnold Neumaier:
A Simple Derivation of the Hansen-Bliek-Rohn-Ning-Kearfott Enclosure for Linear Interval Equations. Reliab. Comput. 5(2): 131-136 (1999) - [p1]Arnold Neumaier, Stefan Dallwig, Waltraud Huyer, Hermann Schichl:
New Techniques for the Construction of Residue Potentials for Protein Folding. Computational Molecular Dynamics 1999: 212-224 - 1998
- [j21]Arnold Neumaier:
János D. Pintér, Global Optimization in Action, Continuous and Lipschitz Optimization: Algorithms, Implementations and Applications. Nonconvex Optimization and Its Applications, Volume 6, Kluwer Academic Publishers, Dordrecht - Boston - London, 1996. J. Glob. Optim. 12(3): 319-321 (1998) - [j20]Arnold Neumaier:
Solving Ill-Conditioned and Singular Linear Systems: A Tutorial on Regularization. SIAM Rev. 40(3): 636-666 (1998) - 1997
- [j19]Clemens Elster, Arnold Neumaier:
A Method of Trust Region Type for Minimizing Noisy Functions. Computing 58(1): 31-46 (1997) - [j18]Arnold Neumaier:
Molecular Modeling of Proteins and Mathematical Prediction of Protein Structure. SIAM Rev. 39(3): 407-460 (1997) - 1996
- [j17]Arnold Neumaier:
Second-order sufficient optimality conditions for local and global nonlinear programming. J. Glob. Optim. 9(2): 141-151 (1996) - [j16]Linda Kaufman, Arnold Neumaier:
PET regularization by envelope guided conjugate gradients. IEEE Trans. Medical Imaging 15(3): 385-389 (1996) - 1994
- [j15]Arnold Neumaier:
Global, rigorous and realistic bounds for the solution of dissipative differential equations. Part I: Theory. Computing 52(4): 315-336 (1994) - 1992
- [j14]Arnold Neumaier:
Completely regular codes. Discret. Math. 106-107: 353-360 (1992) - [j13]Arnold Neumaier:
An optimality criterion for global quadratic optimization. J. Glob. Optim. 2(2): 201-208 (1992) - 1990
- [j12]Arnold Neumaier:
Krein conditions and near polygons. J. Comb. Theory A 54(2): 201-209 (1990)
1980 – 1989
- 1989
- [j11]Arnold Neumaier:
Duality in coherent configurations. Comb. 9(1): 59-67 (1989) - 1988
- [j10]Andries E. Brouwer, Arnold Neumaier:
A remark on partial linear spaces of girth 5 with an application to strongly regular graphs. Comb. 8(1): 57-61 (1988) - [j9]Zuhe Shen, Arnold Neumaier:
A note on Moore's interval test for zeros of nonlinear systems. Computing 40(1): 85-89 (1988) - 1987
- [j8]Arnold Neumaier:
Some Relations between Roots, Holes, and Pillars. Eur. J. Comb. 8(1): 29-33 (1987) - 1985
- [j7]Arnold Neumaier:
Inner product rounding error analysis in the presence of underflow. Computing 34(4): 365-373 (1985) - [c1]Arnold Neumaier:
Linear Interval Equations. Interval Mathematics 1985: 109-120 - 1984
- [j6]R. B. McFeat, Arnold Neumaier:
Some Tuple System Constructions with Applications to Resolvable Designs. J. Comb. Theory A 36(1): 92-100 (1984) - 1983
- [j5]Arnold Neumaier, J. J. Seidel:
Discrete hyperbolic geometry. Comb. 3(2): 219-237 (1983) - 1981
- [j4]Arnold Neumaier:
Distance Matrices and n-dimensional Designs. Eur. J. Comb. 2(2): 165-172 (1981) - [j3]Arnold Neumaier:
Classification of graphs by regularity. J. Comb. Theory B 30(3): 318-331 (1981) - 1980
- [j2]Arnold Neumaier:
Distances, Graphs and Designs. Eur. J. Comb. 1(2): 163-174 (1980) - [j1]Arnold Neumaier:
t1/2 - Designs. J. Comb. Theory A 28(3): 226-248 (1980)
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 2024-10-23 21:26 CEST 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:
