Overview Papers
Papers from IRIN
Papers from EPFL
Papers from the University of Vienna
Papers from the Technical University of Darmstadt
Papers from the University of Coimbra
Papers from the remaining COCONUT partners will be available soon.
A. Neumaier,
Complete Search in Continuous Global Optimization and Constraint
Satisfaction,
to appear in:
Acta Numerica 2004 (A. Iserles, ed.)
Cambridge University Press 2004.
This is a nearly book size extended and updated version of Chapter 4
of the previous report.
Global Optimization in the COCONUT Project, Slides, 2003. (pdf file, 6448K)
Constraint satisfaction and global optimization in robotics, Slides, 2002. (pdf file, 449K)
Slides of Invited Talks from Cocos'02, 1st International Workshop on Global Constrained Optimization and Constraint Satisfaction, Valbonne - Sophia Antipolis, France, 2-4 October 2002
E. Monfroy and C. Castro, Basic Components for Constraint Solver
Cooperations. Proceedings of SAC, 2003.
Download
L. Bordeaux, E. Monfroy and F. Benhamou, Towards automated reasoning on the
properties of numerical constraints. Selected paper from the ERCIM Worskshop,
2003.
Download
E. Petrov, E. Monfroy, Automatic analysis of composite solvers. Proceedings
of ICTAI, 2002.
Download
M. Christie, E. Languénou, L. Granvilliers, Modeling Camera Control with Constrained Hypertubes. Proceedings of CP, 2002.
E. Petrov, F. Benhamou, Improved Interval Constraint Propagation for Constraints on Partial Derivatives. Proceedings of ICCS, 2002.
Martine Ceberio, L. Granvilliers, Solving Nonlinear Equations by Abstraction,
Gaussian Elimination and Interval Methods. Proceedings of FroCoS, 2002.
Download
M. Ceberio and L. Granvilliers. Horner's Rule for Interval Evaluation
Revisited. Computing, 2002.
Download
L. Granvilliers, On the Combination of Interval Constraint Solvers. Reliable
Computing, 2001.
Download
L. Granvilliers and F. Benhamou, Progress in the Solving of a Circuit Design
Problem. Journal of Global Optimization, 2001.
Download
L. Granvilliers, E. Monfroy and F. Benhamou, Symbolic-Interval Cooperation in
Constraint Programming. Proceedings of ISSAC, 2001.
Download
L. Bordeaux, E. Monfroy and F. Benhamou, Improved bounds on the complexity of
kB-consistency. Proceedings of IJCAI 2001.
Download
F. Benhamou and F. Goualard, Universally Quantified Interval Constraints.
Proceedings of CP 2000.
Download
E. Monfroy, Control-driven Constraint Propagation. Journal of Applied
Artificial Intelligence, 2000.
Download
L. Granvilliers and G. Hains, A Conservative Scheme for Parallel Interval
Narrowing. Information Processing Letters, 2000.
Download
E. Monfroy, A Coordination-based Chaotic Iteration Algorithm for Constraint
Propagation. Propagation of SAC, 2000.
Download
E. Monfroy and C. Ringeissen, An Open Automated Framework for Constraint
Solver Extension: the SoleX Approach. Fundamenta Informaticae, 1999.
Download
F. Goualard and F. Benhamou and L. Granvilliers, An Extension of the WAM for
Hybrid Interval Solvers. Journal of Functional and Logic Programming, 1999.
Download
F. Benhamou, F. Goualard, L. Granvilliers and J.-F. Puget, Revising hull and
box consistency. Proceedings of ICLP, 1999.
Download
L. Granvilliers, F. Goualard, F. Benhamou, Box Consistency through Weak Box
Consistency. Proceedings of ICTAI, 1999.
Download
E. Monfroy, Jean-Hugues Réty, Chaotic Iteration for Distributed Constraint
Propagation. Propagation of SAC, 1999.
Download
E. Monfroy: Using ``Weaker'' Functions for Constraint Propagation Over Real
Numbers. Proceedings of SAC, 1999.
Download
F. Arbab, E. Monfroy, Using coordination for cooperative constraint solving.
Proceedings of SAC, 1998.
Download
F. Benhamou and W. Older, Applying Interval Arithmetic to Real, Integer and
Boolean Constraints. Journal of Logic Programming, 1997.
Download
X.-H. Vu, D. Sam-Haroud and M.-C. Silaghi,
Approximation Techniques for Non-linear Problems with Continuum of
Solutions,
In Proceedings of the 5th International Symposium on Abstraction,
Reformulation and Approximation (SARA'2002),
Lecture Notes in Artificial Intelligence, Canada,
LNAI 2371 (ISBN 3-540-43941-2), August, 2002, pp. 224-241.
Download
M.-C. Silaghi, D. Sam-Haroud and B. Faltings,
Search Techniques for Non-Linear Constraints with Inequalities,
In Proceedings of the 14th Canadian Conference on AI, 2001.
Download
C. Lottaz,
Collaborative Design using Solution Spaces,
PhD. Thesis No. 2119, Swiss Federal Institute of Technology (EPFL),
Lausanne (Switzerland), 2000.
Download
C. Lottaz,
Rewriting Numeric CSPs for Consistency Algorithms,
Workshop on Non-Binary Constraints at the International Joint
Conference on Artificial Intelligence (IJCAI), Stockholm,
Aug, 1999, pp. E:1-E:13.
Download
C. Lottaz,
Rewriting Numeric CSPs for Consistency Algorithms,
Short paper in Principles and Practice of Constraint Programming,
Washington DC, USA, Oct, 1999, pp. 486-487.
Download
C. Lottaz, D. Sam-Haroud, B. Faltings and I. Smith,
Constraint Techniques for Collaborative Design,
IEEE International Conference on Tools with Artificial Intelligence
ICTAI, Taipei, R.O.C., Nov, 1998, pp. 34-41.
Download
E. Gelle,
On the Generation of Locally Consistent Solution Spaces in Mixed
Dynamic CSPs,
PhD. Thesis No. 1826, Swiss Federal Institute of Technology (EPFL),
Lausanne (Switzerland), 1998.
Download
B. Faltings and E. Gelle,
Local Consistency for Ternary Numeric Constraints,
In Proceedings of the 15th International Joint Conference on
Artificial Intelligence, Nagoya, Japan, Aug, 1997, pp. 392-400.
Download
D. Sam-Haroud and B. Faltings,
Consistency Techniques for Continuous Constraints,
Constraints, 1(1\&2), Sep, 1996, pp. 85-118.
Download
J. Sam Haroud,
Constraint consistency techniques for continuous constraints,
PhD. Thesis No. 1423, Swiss Federal Institute of Technology (EPFL),
Lausanne (Switzerland), 1995.
Download
H. Schichl,
Global Optimization in the COCONUT project,
to appear in:
Proceedings of the Dagstuhl Seminar "Numerical Software
with Result Verification",
Springer Lecture Notes in Computer Science.
Abstract and Download
H. Schichl,
The COCONUT API Reference Manual,
Version 2.32 (November 2003),
Technical Report, 510 pages.
Abstract and Download
H. Schichl,
VDBL (Vienna Database Library) Reference Manual,
Version 1.0 (July 2003),
Technical Report, 163 pages.
Abstract and Download
H. Schichl,
VGTL (Vienna Graph Template Library) Reference Manual,
Version 1.1 (October 2003)
Technical Report, 323 pages.
Abstract and Download
H. Schichl,
Theoretical Concepts and Design of Modeling Languages,
Chapter 4, pp. 45-62 in: Modeling Languages in Mathematical Optimization
(J. Kallrath, ed.),
Kluwer, Boston 2003.
Abstract and Download
A. Neumaier,
Complete Search in Continuous Global Optimization and Constraint
Satisfaction,
to appear in:
Acta Numerica 2004 (A. Iserles, ed.)
Cambridge University Press 2004.
Abstract and Download
A. Neumaier and H. Schichl,
Sharpening the Karush-John optimality conditions,
submitted.
Abstract and Download
O. Shcherbina, A. Neumaier,
Djamila Sam-Haroud, Xuan-Ha Vu and Tuan-Viet Nguyen,
Benchmarking global optimization and constraint satisfaction codes,
Proc. COCOS'02, Springer, to appear.
Abstract and Download
H. Schichl and A. Neumaier,
Exclusion regions for systems of equations,
SIAM J. Numer. Anal., to appear.
Abstract and Download
H. Schichl and A. Neumaier,
Interval Analysis on DAGs for Global Optimization,
submitted.
Abstract and Download
Slides, Part 1,
Slides, Part 2
A. Neumaier and J.-P. Merlet,
Constraint satisfaction and global optimization in robotics,
Slides, 2002.
pdf file (449K)
W. Huyer and A. Neumaier,
Integral approximation of rays and verification of feasibility,
Relialble Computing, to appear.
Abstract and Download
A. Neumaier and O. Shcherbina,
Safe bounds in linear and mixed-integer programming,
Math. Programming B, to appear.
Abstract and Download
W. Huyer and A. Neumaier,
A new exact penalty function,
SIAM J. Optimization 13 (2003), 1141-1158.
Abstract and Download
A. Neumaier,
Rational functions with prescribed global and local minimizers,
J. Global Optimization 25 (2003), 175-181.
Abstract and Download
C.A. Meyer, C.A. Floudas, and A. Neumaier,
Global optimization with non-factorable constraints,
Industrial and Engineering Chemistry Research,
25 (2002), 6413-6424.
Abstract and Download
A. Neumaier,
Book review of
L. Jaulin, M. Kieffer, O. Didrit and E. Walter,
Applied Interval Analysis, 2001,
SIAM Rev. 44 (2002), 736-739.
Download
A. Neumaier,
Taylor forms - use and limits,
Reliable Computing 9 (2002), 43-79.
Abstract and Download
H. Schichl, A. Neumaier and S. Dallwig,
The NOP-2 modeling language,
Ann. Oper. Research 104 (2001), 281-312.
Abstract and Download
A. Neumaier,
Generalized Lyapunov-Schmidt reduction for parametrized equations
at near singular points,
Linear Algebra Appl. 324 (2001), 119-131.
Abstract and Download
R.B. Kearfott, J. Dian and A. Neumaier,
Existence verification for singular zeros of nonlinear systems,
SIAM J. Numer. Anal. 38 (2000), 360-379.
Abstract and Download
W. Huyer and A. Neumaier,
Global optimization by multilevel coordinate search,
J. Global Optimization 14 (1999), 331-355.
Abstract and Download
A. Neumaier,
A simple derivation of the Hansen-Bliek-Rohn-Ning-Kearfott
enclosure for linear interval equations,
Reliable Computing 5 (1999), 131-136.
Erratum, Reliable Computing 6 (2000), 227.
Abstract and Download
O89.
C.S. Adjiman, S. Dallwig, C.A. Floudas and A. Neumaier,
A global optimization method, alphaBB, for general
twice-differentiable constrained NLPs - I. Theoretical advances,
Computers and Chemical Engineering 22 (1998), 1137-1158.
Abstract and Download
A. Neumaier,
Book review of:
Janos D. Pinter: Global Optimization in Action,
Kluwer, Dordrecht 1996.
J. Global Optimization 12 (1998), 319-321.
html file
A. Neumaier, S. Dallwig and H. Schichl,
GLOPT - A Program for Constrained Global Optimization,
pp. 19-36 in:
I. Bomze et al., eds.,
Developments in Global Optimization,
Kluwer, Dordrecht 1997.
Abstract and Download
A. Neumaier,
Second-order sufficient optimality conditions for local and global
nonlinear programming,
J. Global Optim. 9 (1996), 141-151.
Abstract and Download
A. Neumaier, Book review of: Eldon Hansen: Global Optimization Using Interval Analysis, Dekker, New York 1992. Math. Comput. 63 (1994), 428-431.
A. Neumaier, An optimality criterion for global quadratic optimization, J. Global Optimization 2 (1992), 201-208.
A. Neumaier, Interval Methods for Systems of Equations. Encyclopedia of Mathematics and its Applications 37, Cambridge Univ. Press, Cambridge 1990.
A. Neumaier, Rigorous sensitivity analysis for parameter-dependent systems of equations, J. Math. Anal. Appl. 144 (1989), 16-25.
A. Neumaier,
The enclosure of solutions of parameter-dependent systems of
equations.
In: Reliability in Computing
(ed. by R.E. Moore).
Acad. Press, San Diego 1988, pp. 269-286.
scanned text
A. Neumaier, Existence of solutions of piecewise differentiable systems of equations, Arch. Math. 47 (1986), 443-447.
A. Neumaier, Existence regions and error bounds for implicit and inverse functions, Z. Angew. Math. Mech. 65 (1985), 49-55.
R. Krawczyk and A. Neumaier, Interval slopes for rational functions and associated centered forms, SIAM J. Numer. Anal. 22 (1985), 604-616.
P. Spellucci, Nonlinear (local) optimization. The state of the art. Journal of Computational Technologies 6, (2001), 64-102.
P. Spellucci,
Einige Aspekte bei der Beurteilung und
Auswahl von Optimierungsverfahren
fuer kontinuierliche Probleme (slides) 1998
(Some aspects for judging and
choosing a method for nonlinear continuous
optimization (in German).
(available as file nloaspekte.ps from)
download
P. Spellucci, An SQP method for general nonlinear programs using only equality constrained subproblems. Mathematical Programming 82 (1998) 413-448
P. Spellucci, A New technique for Inconsistent QP Problems in the SQP method. Math. Meth. of Oper. Res. 47, (1998), 355-400
P. Spellucci,
Einige Aspekte bei der Beurteilung und
Auswahl von Optimierungsverfahren
fuer kontinuierliche Probleme (slides) 1998
(Some aspects for judging and
choosing a method for nonlinear continuous
optimization (in German).
(available as file nloaspekte.ps from)
Download
P. Spellucci, Numerical experiments with modern methods for large scale QP-problems. in: Recent Advances in Optimization. (Gritzmann, Horst, Sachs, Tichatschke eds.) Lecture Notes in Economical and Mathematical systems 452 (1997), pp 315-335.
P. Spellucci, R. Felkel,
Numerical experiments with an exact penalty
function for convex
inequality constrained QP-problems. TUD
Dept. of Math. preprint 1815, (1996)
(available as file trsqp.ps.gz from)
download
P. Spellucci,
Solving General Convex QP problems via an
exact quadratic augmented
Lagrangian with Boound Constraints. TUD
Dept. of Math. preprint 1563 (1993)
Revised 6/96 (available as file qp.ps.gz
from)
download
M. Ulbrich, S. Ulbrich, and L. N. Vicente,
A globally convergent primal-dual interior-point filter method for
nonlinear programming, submitted.
Abstract and Download
C. P. Avelino and L. N. Vicente,
Updating multipliers corresponding to Inequality constraints in an
augmented Lagrangian multipliers method,
submitted.
Abstract and Download
L. N. Vicente and S. J. Wright, Local convergence of a primal-dual method for degenerate nonlinear programming, Comput. Optim. Appl. 22 (2002), 311-328.
L. N. Vicente, Local analysis of a new multipliers method, Europ. J. Oper. Res. 143 (2002), 432-451.
M. Heinkenschloss and L. N. Vicente, Analysis of inexact trust-region SQP algorithms, SIAM J. Optimization 12 (2001), 283-302.
L. N. Vicente, Local convergence of the affine-scaling interior-point algorithm for nonlinear programming, Comput. Optim. Appl. 17 (2000), 23-35.
D. A. Andrews and L. N. Vicente, Characterization of the smoothness and curvature of a marginal function for a trust-region problem, Math. Programming 84 (1999), 123-135.
A. R. Conn, L. N. Vicente, and C. Visweswariah, Two-step algorithms for nonlinear optimization with structured applications, SIAM J. Optimization 9 (1999), 924-947.
L. N. Vicente, An analysis of Newton's method for equivalent Karush-Kuhn-Tucker systems, Investigación Operativa 7 (1999), 17-28.
J. E. Dennis, M. Heinkenschloss, and L. N. Vicente, Trust-region interior-point SQP algorithms for a class of nonlinear programming problems, SIAM J. Control Optimization 36 (1998), 1750-1794.
J. E. Dennis and L. N. Vicente, On the convergence theory of trust-region-based algorithms for equality-constrained optimization, SIAM J. Optimization 7 (1997), 527-550.
L. N. Vicente, A comparison between line searches and trust regions for nonlinear optimization, Investigação Operacional 16 (1996), 173-179.
J. E. Dennis and L. N. Vicente, Trust-region interior-point algorithms for minimization problems with simple bounds, pp. 97-107 in: Applied Mathematics and Parallel Computing, Festschrift for Klaus Ritter, ed. by H. Fisher, B. Riedmüller, and S. Schäffler, Physica-Verlag, 1996.
L. F. Portugal, J. J. Júdice, and L. N. Vicente, A comparison of block pivoting and interior-point algorithms for linear least squares problems with nonnegative variables, Math. Comput. 63, (1994) 625-643.
J. J. Júdice and L. N. Vicente, On the solution and complexity of a generalized linear complementarity problem, J. Global Optim. 4 (1994), 415-424.