Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')
EuDML - The European Digital Mathematics Library

Login | Register | (Why Register?)

  • Home
  • Advanced Search
  • Browse by Subject
  • Browse by Journals
  • Refs Lookup
  • Subjects
  • 90-XX Operations research, mathematical programming
  • 90Cxx Mathematical programming
  • 90C30 Nonlinear programming

90Cxx Mathematical programming

  • 90C05 Linear programming
  • 90C06 Large-scale problems
  • 90C08 Special problems of linear programming (transportation, multi-index, etc.)
  • 90C09 Boolean programming
  • 90C10 Integer programming
  • 90C11 Mixed integer programming
  • 90C15 Stochastic programming
  • 90C20 Quadratic programming
  • 90C22 Semidefinite programming
  • 90C25 Convex programming
  • 90C26 Nonconvex programming, global optimization
  • 90C27 Combinatorial optimization
  • 90C29 Multi-objective and goal programming
  • 90C30 Nonlinear programming
  • 90C31 Sensitivity, stability, parametric optimization
  • 90C32 Fractional programming
  • 90C33 Complementarity and equilibrium problems and variational inequalities (finite dimensions)
  • 90C34 Semi-infinite programming
  • 90C35 Programming involving graphs or networks
  • 90C39 Dynamic programming
  • 90C40 Markov and semi-Markov decision processes
  • 90C46 Optimality conditions, duality
  • 90C47 Minimax problems
  • 90C48 Programming in abstract spaces
  • 90C49 Extreme-point and pivoting methods
  • 90C51 Interior-point methods
  • 90C52 Methods of reduced gradient type
  • 90C53 Methods of quasi-Newton type
  • 90C55 Methods of successive quadratic programming type
  • 90C56 Derivative-free methods and methods using generalized derivatives
  • 90C57 Polyhedral combinatorics, branch-and-bound, branch-and-cut
  • 90C59 Approximation methods and heuristics
  • 90C60 Abstract computational complexity for mathematical programming problems
  • 90C70 Fuzzy programming
  • 90C90 Applications of mathematical programming
  • 90C99 None of the above, but in this section
  • Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1

Displaying 1 – 6 of 6

Showing per page

Quasi-Newton gradient method with analytical determination of the direction and length of step

Peter Hudzovič (1988)

Kybernetika

Quasi-Newton methods without projections for linearly constrained minimization

Ladislav Lukšan (1982)

Kybernetika

Quasi-Newton methods without projections for unconstrained minimization

Ladislav Lukšan (1982)

Kybernetika

Quasi-Newton-Verfahren vom Rang-Eins-Typ zur Lösung unrestringierter Minimierungsprobleme. Teil 1. Verfahren und grundlegende Eigenschaften.

H. Kleinmichel (1982)

Numerische Mathematik

Quasi-Newton-Verfahren vom Rang-Eins-Typ zur Lösung unrestringierter Minimierungsprobleme. Teil 2. «-Schritt-quadratische Konvergenz für Restart-Varianten.

H. Kleinmichel (1982)

Numerische Mathematik

Quelques expériences numériques sur la programmation non linéaire en nombres entiers

J. Abadie, H. Dayan, J. Akoka (1976)

RAIRO - Operations Research - Recherche Opérationnelle

Currently displaying 1 – 6 of 6

Page 1

EuDML
  • About EuDML initiative
  • Feedback
  •  version 2.1.7