Arnold Neumaier

Orcid: 0000-0002-8328-9641

Affiliations:
  • University of Vienna, Austria


According to our database1, Arnold Neumaier authored at least 96 papers between 1980 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Globally linearly convergent nonlinear conjugate gradients without Wolfe line search.
Numer. Algorithms, December, 2024

Effective matrix adaptation strategy for noisy derivative-free optimization.
Math. Program. Comput., September, 2024

An improvement of the Goldstein line search.
Optim. Lett., July, 2024

2023
New Subspace Method for Unconstrained Derivative-Free Optimization.
ACM Trans. Math. Softw., December, 2023

2022
A new limited memory method for unconstrained nonlinear least squares.
Soft Comput., 2022

LMBOPT: a limited memory method for bound-constrained optimization.
Math. Program. Comput., 2022

Efficient unconstrained black box optimization.
Math. Program. Comput., 2022

A unified view of inequalities for distance-regular graphs, part I.
J. Comb. Theory B, 2022

On Bounding the Diameter of a Distance-Regular Graph.
Comb., 2022

2021
An Exact Method for the Minimum Feedback Arc Set Problem.
ACM J. Exp. Algorithmics, 2021

2019
Rigorous packing of unit squares into a circle.
J. Glob. Optim., 2019

A manifold-based approach to sparse global constraint satisfaction problems.
J. Glob. Optim., 2019

2018
A computational study of global optimization solvers on two trust region subproblems.
J. Glob. Optim., 2018

MINQ8: general definite and bound constrained indefinite quadratic programming.
Comput. Optim. Appl., 2018

2017
A robust approach for finding all well-separated solutions of sparse systems of nonlinear equations.
Numer. Algorithms, 2017

Optimal subgradient algorithms for large-scale convex optimization in simple domains.
Numer. Algorithms, 2017

An optimal subgradient algorithm for large-scale bound-constrained convex optimization.
Math. Methods Oper. Res., 2017

Certificates of infeasibility via nonsmooth optimization.
J. Glob. Optim., 2017

Bounding basis reduction properties.
Des. Codes Cryptogr., 2017

Failure Modes of Tearing and a Novel Robust Approach.
Proceedings of the 12th International Modelica Conference, Prague, Czech Republic, 2017

2016
OSGA: a fast subgradient algorithm with optimal complexity.
Math. Program., 2016

Constraint aggregation for rigorous global optimization.
Math. Program., 2016

Linear and parabolic relaxations for quadratic constraints.
J. Glob. Optim., 2016

Worst case error bounds for the solution of uncertain Poisson equations with mixed boundary conditions.
J. Comput. Appl. Math., 2016

Faster LLL-type Reduction of Lattice Bases.
IACR Cryptol. ePrint Arch., 2016

2015
Rigorous verification of feasibility.
J. Glob. Optim., 2015

2014
Global Attractivity of the Zero Solution for Wright's Equation.
SIAM J. Appl. Dyn. Syst., 2014

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

Exclusion regions for optimization problems.
J. Glob. Optim., 2014

2013
Error bounds for initial value problems by optimization.
Soft Comput., 2013

Solving Overdetermined Eigenvalue Problems.
SIAM J. Sci. Comput., 2013

On Solving Mixed-Integer Constraint Satisfaction Problems with Unbounded Variables.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2013

2012
Continuity Notions for Multi-Valued Mappings with Possibly Disconnected Images.
Reliab. Comput., 2012

Rigorous filtering using linear relaxations.
J. Glob. Optim., 2012

Black Box Optimization Benchmarking of the GLOBAL Method.
Evol. Comput., 2012

DynGenPar - A Dynamic Generalized Parser for Common Mathematical Language.
Proceedings of the Intelligent Computer Mathematics - 11th International Conference, 2012

2011
VXQR: derivative-free unconstrained optimization based on QR factorizations.
Soft Comput., 2011

Rigorous Enclosures of Ellipsoids and Directed Cholesky Factorizations.
SIAM J. Matrix Anal. Appl., 2011

2010
Convexity and Concavity Detection in Computational Graphs: Tree Walks for Convexity Assessment.
INFORMS J. Comput., 2010

Constraint propagation on quadratic constraints.
Constraints An Int. J., 2010

A Framework for Representing and Processing Arbitrary Mathematics.
Proceedings of the KEOD 2010, 2010

Discrete Search in Design Optimization.
Proceedings of the Complex Systems Design & Management, 2010

2008
SNOBFIT - Stable Noisy Optimization by Branch and Fit.
ACM Trans. Math. Softw., 2008

A scaling algorithm for polynomial constraint satisfaction problems.
J. Glob. Optim., 2008

Handling Uncertainty in Higher Dimensions with Potential Clouds towards Robust Design Optimization.
Proceedings of the Soft Methods for Handling Variability and Imprecision, 2008

2007
Linear Systems with Large Uncertainties, with Applications to Truss Structures.
Reliab. Comput., 2007

New bounds for Morse clusters.
J. Glob. Optim., 2007

On Graphs Whose Spectral Radius is Bounded by \frac32Ö2\frac{3}{2}\sqrt{2}.
Graphs Comb., 2007

2006
Transposition Theorems and Qualification-Free Optimality Conditions.
SIAM J. Optim., 2006

2005
A comparison of complete global optimization solvers.
Math. Program., 2005

Interval Analysis on Directed Acyclic Graphs for Global Optimization.
J. Glob. Optim., 2005

2004
Exclusion Regions for Systems of Equations.
SIAM J. Numer. Anal., 2004

Clouds, Fuzzy Sets, and Probability Intervals.
Reliab. Comput., 2004

Integral Approximation of Rays and Verification of Feasibility.
Reliab. Comput., 2004

Safe bounds in linear and mixed-integer linear programming.
Math. Program., 2004

Dual polar spaces as extremal distance-regular graphs.
Eur. J. Comb., 2004

Interval Methods for Certification of the Kinematic Calibration of Parallel Robots.
Proceedings of the 2004 IEEE International Conference on Robotics and Automation, 2004

2003
A New Exact Penalty Function.
SIAM J. Optim., 2003

Taylor Forms--Use and Limits.
Reliab. Comput., 2003

Rational Functions with Prescribed Global and Local Minimizers.
J. Glob. Optim., 2003

Fuzzy modeling in terms of surprise.
Fuzzy Sets Syst., 2003

2002
Grand Challenges and Scientific Standards in Interval Analysis.
Reliab. Comput., 2002

A New Approach to Incorporate Uncertainty in Terrain Modeling.
Proceedings of the Geographic Information Science, Second International Conference, 2002

Benchmarking Global Optimization and Constraint Satisfaction Codes.
Proceedings of the Global Optimization and Constraint Satisfaction, 2002

2001
Algorithm 808: ARfit - a matlab package for the estimation of parameters and eigenmodes of multivariate autoregressive models.
ACM Trans. Math. Softw., 2001

Estimation of parameters and eigenmodes of multivariate autoregressive models.
ACM Trans. Math. Softw., 2001

The NOP-2 Modeling Language for Nonlinear Programming.
Ann. Oper. Res., 2001

Optimization Under Uncertainty: Methods and Applications in Radiation Therapy.
Proceedings of the 10th IEEE International Conference on Fuzzy Systems, 2001

Introduction to Numerical Analysis.
Cambridge University Press, ISBN: 978-0-521-33610-9, 2001

2000
Existence Verification for Singular Zeros of Complex Nonlinear Systems.
SIAM J. Numer. Anal., 2000

On Shary's Algebraic Approach for Linear Interval Equations.
SIAM J. Matrix Anal. Appl., 2000

1999
A Simple Derivation of the Hansen-Bliek-Rohn-Ning-Kearfott Enclosure for Linear Interval Equations.
Reliab. Comput., 1999

Global Optimization by Multilevel Coordinate Search.
J. Glob. Optim., 1999

New Techniques for the Construction of Residue Potentials for Protein Folding.
Proceedings of the Computational Molecular Dynamics: Challenges, Methods, Ideas, 1999

1998
Solving Ill-Conditioned and Singular Linear Systems: A Tutorial on Regularization.
SIAM Rev., 1998

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., 1998

1997
Molecular Modeling of Proteins and Mathematical Prediction of Protein Structure.
SIAM Rev., 1997

A Method of Trust Region Type for Minimizing Noisy Functions.
Computing, 1997

1996
PET regularization by envelope guided conjugate gradients.
IEEE Trans. Medical Imaging, 1996

Second-order sufficient optimality conditions for local and global nonlinear programming.
J. Glob. Optim., 1996

1994
Global, rigorous and realistic bounds for the solution of dissipative differential equations. Part I: Theory.
Computing, 1994

1992
An optimality criterion for global quadratic optimization.
J. Glob. Optim., 1992

Completely regular codes.
Discret. Math., 1992

1990
Krein conditions and near polygons.
J. Comb. Theory A, 1990

1989
Duality in coherent configurations.
Comb., 1989

1988
A note on Moore's interval test for zeros of nonlinear systems.
Computing, 1988

A remark on partial linear spaces of girth 5 with an application to strongly regular graphs.
Comb., 1988

1987
Some Relations between Roots, Holes, and Pillars.
Eur. J. Comb., 1987

1985
Inner product rounding error analysis in the presence of underflow.
Computing, 1985

Linear Interval Equations.
Proceedings of the Interval Mathemantics 1985: Proceedings of the International Symposium, 1985

1984
Some Tuple System Constructions with Applications to Resolvable Designs.
J. Comb. Theory A, 1984

1983
Discrete hyperbolic geometry.
Comb., 1983

1981
Classification of graphs by regularity.
J. Comb. Theory B, 1981

Distance Matrices and n-dimensional Designs.
Eur. J. Comb., 1981

1980
t<sup>1/2</sup> - Designs.
J. Comb. Theory A, 1980

Distances, Graphs and Designs.
Eur. J. Comb., 1980


  Loading...