12-18

ABS Algorithms for Linear Equations and Linear Least Squares
Abaffi–Broyden–Spedicato Algorithms for Linear Equations and Linear Least Squares

Emilio Spedicato

• View HTML

1159-1166

ABS algorithms for linear equations and linear least squares; Automatic differentiation: Point and interval; Automatic differentiation: Point and interval Taylor operators; Bounding derivative ranges; Cholesky factorization; Global optimization: Application to phase equilibrium problems; Interval analysis: Application to chemical engineering design problems; Interval analysis: Differential equations; Interval analysis: Eigenvalue bounds of interval matrices; Interval analysis: Intermediate terms; Interval analysis: Nondifferentiable problems; Interval analysis: Parallel methods for global optimization; Interval analysis: Subdivision directions in interval branch and bound methods; Interval analysis: Systems of nonlinear equations; Interval analysis: Unconstrained and constrained optimization; Interval analysis: Verifying feasibility; Interval constraints; Interval fixed point theory; Interval global optimization; Interval Newton methods; Large scale trust region problems; Large scal

C. Jansson

• View HTML

19-25

ABS Algorithms for Optimization
Abaffy–Broyden–Spedicato Algorithms for Optimization

Emilio Spedicato, Zunquan Xia and Liwei Zhang

• View HTML

25-27

Adaptive Global Search

J. Calvin

• View HTML

27-31

Adaptive Simulated Annealing and its Application to Protein Folding
ASA

Ruth Pachter and Zhiqiang Wang

• View HTML

31-32

Affine Sets and Functions

Leonidas Pitsoulis

• View HTML

32-35

Airline Optimization

Gang Yu and Benjamin Thengvall

• View HTML

1032-1039

Airline optimization; Alignment problem; Branch and price: Integer programming with column generation; Decomposition techniques for MILP: Lagrangian relaxation; Graph coloring; Integer linear complementary problem; Integer programming; Integer programming: Algebraic methods; Integer programming: Branch and bound methods; Integer programming: Branch and cut algorithms; Integer programming: Cutting plane algorithms; Integer programming duality; Integer programming: Lagrangian relaxation; LCP: Pardalos–Rosen mixed integer formulation; Maximum satisfiability problem; Mixed integer classification problems; Multi-objective integer linear programming; Multi-objective mixed integer programming; Multidimensional knapsack problems; Multiparametric mixed integer linear programming; Optimization in leveled graphs; Parametric mixed integer nonlinear optimization; Quadratic knapsack; Set covering, packing and partitioning problems; Simplicial pivoting algorithms for integer programming: Stochasti

Egon Balas

• View HTML

35-43

Alignment Problem

Claude Diderich and Marc Gengler

• View HTML

43-47

Alternative Set Theory
AST

Petr Vopěnka and Kateřina Trlifajová

• View HTML

1012-1020

Alternative set theory; Boolean and fuzzy relations; Checklist paradigm semantics for fuzzy logics; Finite complete systems of many-valued logic algebras; Optimization in Boolean classification problems; Optimization in classifying text documents INFERENCE OF MONOTONE BOOLEAN FUNCTIONS

Vetle Torvik and Evangelos Triantaphyllou

• View HTML

678-685

Alternative set theory; Boolean and fuzzy relations; Checklist paradigm semantics for fuzzy logics; Inference of monotone Boolean functions; Optimization in Boolean classification problems; Optimization in classifying text documentsAlternative set theory; Boolean and fuzzy relations; Checklist paradigm semantics for fuzzy logics; Inference of monotone Boolean functions; Optimization in Boolean classification problems; Optimization in classifying text documentsFINITE COMPLETE SYSTEMS OF MANY-VALUED LOGIC ALGEBRAS

Ladislav Kohout

• View HTML

47-52

Approximation of Extremum Problems with Probability Functionals
APF

Riho Lepp

• View HTML

53-59

Approximation of Multivariate Probability Integrals

Tamás Szántai

• View HTML

60-62

Assignment and Matching
AM

Dimitris Alevras

• View HTML

715-719

Assignment and matching; Assignment methods in clustering; Bi-objective assignment problem; Communication network assignment problem; Graph coloring; Maximum constraint satisfaction: Relaxations and upper bounds; Maximum partition matching; Quadratic assignment problemAssignment and matching; Assignment methods in clustering; Bi-objective assignment problem; Communication network assignment problem Graph coloring; Linear ordering problem; Maximum constraint satisfaction: Relaxations and upper bounds; Maximum partition matching; Quadratic assignment problemFREQUENCY ASSIGNMENT PROBLEM
FAP

Robert Murphey

• View HTML

62-68

Assignment Methods in Clustering

L. Hubert and P. Arabie

• View HTML

68-73

Asynchronous Distributed Optimization Algorithms

Ioannis Androulakis

• View HTML

1113-1120

Asynchronous distributed optimization algorithms; Automatic differentiation: Parallel computation; Automatic differentiation: Point and interval; Automatic differentiation: Point and interval Taylor operators; Bounding derivative ranges; Global optimization: Application to phase equilibrium problems; Heuristic search; Interval analysis: Application to chemical engineering design problems; Interval analysis: Differential equations; Interval analysis: Eigenvalue bounds of interval matrices; Interval analysis: Intermediate terms; Interval analysis: Nondifferentiable problems; Interval analysis: Subdivision directions in interval branch and bound methods; Interval analysis: Systems of nonlinear equations; Interval analysis: Unconstrained and constrained optimization; Interval analysis: Verifying feasibility; Interval constraints; Interval fixed point theory; Interval global optimization; Interval linear systems; Interval Newton methods; Load balancing for parallel optimization technique

Anthony Leclerc

• View HTML

949-951

Asynchronous distributed optimization algorithms; Automatic differentiation: Parallel computation; Interval analysis: Parallel methods for global optimization; Load balancing for parallel optimization techniques; Parallel computing: Complexity classes; Parallel computing: Models; Parallel heuristic search; Stochastic network problems: Massively parallel solution HEURISTIC SEARCH

Alexander Reinefeld

• View HTML

73-77

Auction Algorithms

Dimitri Bertsekas

• View HTML

559-563

Auction algorithms; Communication network assignment problem; Directed tree networks; Dynamic traffic networks; Evacuation networks; Financial equilibrium; Generalized monotonicity: Applications to variational inequalities and equilibrium problems; Generalized networks; Maximum flow problem; Minimum cost flow problem; Network design problems; Network location: Covering problems; Nonconvex network flow problems; Oligopolistic market equilibrium; Piecewise linear network flow problems; Shortest path tree algorithms; Spatial price equilibrium; Steiner tree problems; Stochastic network problems: Massively parallel solution; Survivable networks; Traffic network equilibrium; Walrasian price equilibriumEQUILIBRIUM NETWORKS

Anna Nagurney

• View HTML

77-82

Automatic Differentiation: Calculation of Newton Steps

Laurence Dixon

• View HTML

1166-1168

Automatic differentiation: Calculation of Newton steps; Automatic differentiation: Point and interval; Automatic differentiation: Point and interval Taylor operators; Bounding derivative ranges; Complexity classes in optimization; Dynamic programming and Newton's method in unconstrained optimal control; Global optimization: Application to phase equilibrium problems; Interval analysis: Application to chemical engineering design problems; Interval analysis: Differential equations; Interval analysis: Eigenvalue bounds of interval matrices; Interval analysis: Intermediate terms; Interval analysis: Nondifferentiable problems; Interval analysis: Parallel methods for global optimization; Interval analysis: Subdivision directions in interval branch and bound methods; Interval analysis: Systems of nonlinear equations; Interval analysis: Unconstrained and constrained optimization; Interval analysis: Verifying feasibility; Interval constraints; Interval fixed point theory; Interval global opti

R. Kearfott

• View HTML

82-86

Automatic Differentiation: Calculation of the Hessian

Laurence Dixon

• View HTML

86-97

Automatic Differentiation: Geometry of Satellites and

Dan Kalman

• View HTML

97-102

Automatic Differentiation: Introduction, History and Rounding Error Estimation

Masao Iri and Koichi Kubota

• View HTML

1108-1111

Automatic differentiation: Introduction, history and rounding error estimation; Automatic differentiation: Point and interval; Automatic differentiation: Point and interval Taylor operators; Bounding derivative ranges; Global optimization: Application to phase equilibrium problems; Interval analysis: Application to chemical engineering design problems; Interval analysis: Differential equations; Interval analysis: Eigenvalue bounds of interval matrices; Interval analysis: Nondifferentiable problems; Interval analysis: Parallel methods for global optimization; Interval analysis: Subdivision directions in interval branch and bound methods; Interval analysis: Systems of nonlinear equations; Interval analysis: Unconstrained and constrained optimization; Interval analysis: Verifying feasibility; Interval constraints; Interval fixed point theory; Interval global optimization; Interval linear systems; Interval Newton methods INTERVAL ANALYSIS: INTERMEDIATE TERMS

R. Kearfott

• View HTML

102-108

Automatic Differentiation: Parallel Computation

Christian Bischof and Paul Hovland

• View HTML

108-113

Automatic Differentiation: Point and Interval
AD

L. Rall and George Corliss

• View HTML

113-118

Automatic Differentiation: Point and Interval Taylor Operators
AD, Computational Differentiation

James Walters and George Corliss

• View HTML

1095-1098

Automatic differentiation: Point and interval; Automatic differentiation: Point and interval Taylor operators; Bilevel programming: Applications in engineering; Bounding derivative ranges; Design optimization in computational fluid dynamics; Global optimization: Application to phase equilibrium problems; Interval analysis: Differential equations; Interval analysis: Eigenvalue bounds of interval matrices; Interval analysis: Intermediate terms; Interval analysis: Nondifferentiable problems; Interval analysis: Parallel methods for global optimization; Interval analysis: Subdivision directions in interval branch and bound methods; Interval analysis: Systems of nonlinear equations; Interval analysis: Unconstrained and constrained optimization; Interval analysis: Verifying feasibility; Interval constraints; Interval fixed point theory; Interval global optimization; Interval linear systems; Interval Newton methods; Multidisciplinary design optimization; Multilevel methods for optimal desig

Mark Stadtherr

• View HTML

1124-1130

Automatic differentiation: Point and interval; Automatic differentiation: Point and interval Taylor operators; Bounding derivative ranges; Contraction-mapping; Global optimization: Application to phase equilibrium problems; Global optimization methods for systems of nonlinear equations; Interval analysis: Application to chemical engineering design problems; Interval analysis: Differential equations; Interval analysis: Eigenvalue bounds of interval matrices; Interval analysis: Intermediate terms; Interval analysis: Nondifferentiable problems; Interval analysis: Parallel methods for global optimization; Interval analysis: Subdivision directions in interval branch and bound methods; Interval analysis: Unconstrained and constrained optimization; Interval analysis: Verifying feasibility; Interval constraints; Interval fixed point theory; Interval global optimization; Interval linear systems; Interval Newton methods; Nonlinear least squares: Newton-type methods; Nonlinear systems of equat

Ramon Moore

• View HTML

1130-1133

Automatic differentiation: Point and interval; Automatic differentiation: Point and interval Taylor operators; Bounding derivative ranges; Direct search Luus-Jaakola optimization procedure; Global optimization: Application to phase equilibrium problems; Interval analysis: Application to chemical engineering design problems; Interval analysis: Differential equations; Interval analysis: Eigenvalue bounds of interval matrices; Interval analysis: Intermediate terms; interval analysis: Nondifferentiable problems; Interval analysis: Parallel methods for global optimization; Interval analysis: Subdivision directions in interval branch and bound methods; Interval analysis: Systems of nonlinear equations; Interval analysis: Verifying feasibility; Interval constraints; Interval fixed point theory; Interval global optimization; Interval linear systems; Interval Newton methods INTERVAL ANALYSIS: UNCONSTRAINED AND CONSTRAINED OPTIMIZATION

R. Kearfott

• View HTML

1138-1141

Automatic differentiation: Point and interval; Automatic differentiation: Point and interval Taylor operators; Bounding derivative ranges; Global optimization: Application to phase equilibrium problems; Interval analysis: Application to chemical engineering design problems; Interval analysis: Differential equations; Interval analysis: Eigenvalue bounds of interval matrices; Interval analysis: Intermediate terms; Interval analysis: Nondifferentiable problems; Interval analysis: Parallel methods for global optimization; Interval analysis: Subdivision directions in interval branch and bound methods; Interval analysis: Systems of nonlinear equations; Interval analysis: Unconstrained and constrained optimization; Interval analysis: Verifying feasibility; Interval constraints; Interval global optimization; Interval linear systems; Interval Newton methods INTERVAL FIXED POINT THEORY

R. Kearfott

• View HTML

1135-1138

Automatic differentiation: Point and interval; Automatic differentiation: Point and interval Taylor operators; Bounding derivative ranges; Global optimization: Application to phase equilibrium problems; Interval analysis: Application to chemical engineering design problems; Interval analysis: Differential equations; Interval analysis: Eigenvalue bounds of interval matrices; Interval analysis: Intermediate terms; Interval analysis: Nondifferentiable problems; Interval analysis: Parallel methods for global optimization; Interval analysis: Subdivision directions in interval branch and bound methods; Interval analysis: Systems of nonlinear equations; Interval analysis: Unconstrained and constrained optimization; Interval analysis: Verifying feasibility; Interval fixed point theory; Interval global optimization; Interval linear systems; Interval Newton methods INTERVAL CONSTRAINTS
interval propagation

Frédéric Benhamou

• View HTML

1120-1124

Automatic differentiation: Point and interval; Automatic differentiation: Point and interval Taylor operators; Bounding derivative ranges; Global optimization: Application to phase equilibrium problems; Interval analysis: Application to chemical engineering design problems; Interval analysis: Differential equations; Interval analysis: Eigenvalue bounds of interval matrices; Interval analysis: Intermediate terms; Interval analysis: Nondifferentiable problems; Interval analysis: Parallel methods for global optimization; Interval analysis: Systems of nonlinear equations; Interval analysis: Unconstrained and constrained optimization; Interval analysis: Verifying feasibility; Interval constraints; Interval fixed point theory; Interval global optimization; Interval linear systems; Interval Newton methods INTERVAL ANALYSIS: SUBDIVISION DIRECTIONS IN INTERVAL BRANCH AND BOUND METHODS

Tibor Csendes

• View HTML

1111-1113

Automatic differentiation: Point and interval; Automatic differentiation: Point and interval Taylor operators; Bounding derivative ranges; Global optimization: Application to phase equilibrium problems; Interval analysis: Application to chemical engineering design problems; Interval analysis: Differential equations; Interval analysis: Eigenvalue bounds of interval matrices; Interval analysis: Intermediate terms; Interval analysis: Parallel methods for global optimization; Interval analysis: Subdivision directions in interval branch and bound methods; Interval analysis: Systems of nonlinear equations; Interval analysis: Unconstrained and constrained optimization; Interval analysis: Verifying feasibility; Interval constraints; Interval fixed point theory; Interval global optimization; Interval linear systems; Interval Newton methods INTERVAL ANALYSIS: NONDIFFERENTIABLE PROBLEMS

R. Kearfott

• View HTML

1133-1135

Automatic differentiation: Point and interval; Automatic differentiation: Point and interval Taylor operators; Bounding derivative ranges; Global optimization: Application to phase equilibrium problems; Interval analysis: Application to chemical engineering design problems; Interval analysis: Differential equations; Interval analysis Eigenvalue bounds of interval matrices; Interval analysis: Intermediate terms; Interval analysis: Nondifferentiable problems; Interval analysis: Parallel methods for global optimization; Interval analysis: Subdivision directions in interval branch and bound methods; Interval analysis: Systems of nonlinear equations; Interval analysis: Unconstrained and constrained optimization; Interval constraints; Interval fixed point theory; Interval global optimization; Interval linear systems; Interval Newton methods INTERVAL ANALYSIS: VERIFYING FEASIBILITY

R. Kearfott

• View HTML

1098-1101

Automatic differentiation: Point and interval; Automatic differentiation: Point and interval Taylor operators; Bounding derivative ranges; Global optimization: Application to phase equilibrium problems; Interval analysis: Application to chemical engineering design problems; Interval analysis: Eigenvalue bounds of interval matrices; Interval analysis: Intermediate terms; Interval analysis: Nondifferentiable problems; Interval analysis: Parallel methods for global optimization; Interval analysis: Subdivision directions in interval branch and bound methods; Interval analysis: Systems of nonlinear equations; Interval analysis: Unconstrained and constrained optimization; Interval analysis: Verifying feasibility; Interval constraints; Interval fixed point theory; Interval global optimization; Interval linear systems; Interval Newton methods INTERVAL ANALYSIS: DIFFERENTIAL EQUATIONS

Ramon Moore

• View HTML

118-122

Automatic Differentiation: Root Problem and Branch Problem

Herbert Fischer

• View HTML