49Mxx Methods of successive approximations,
{For discrete problems, see 90Cxx; See also 65Kxx}
- 49M05 Methods based on necessary conditions
- 49M07 Gradient methods
- 49M10 Methods of steepest descent type
- 49M15 Methods of Newton-Raphson, Galerkin and Ritz types
- 49M20 Methods of relaxation type
- 49M25 Finite difference methods
- 49M27 Decomposition methods
- 49M29 Multiplier methods
- 49M30 Other methods, not based on necessary conditions (penalty function, etc.)
- 49M35 Methods of linear programming type, See also {90C05}
- 49M37 Nonlinear programming, See also {90C30}
- 49M39 Semi-infinite programming, See also {90C34}
- 49M40 Methods of quadratic programming type, See also {90C20}
- 49M45 Methods of convex programming type, See also {90C25}
- 49M49 Geometric programming, See also {90C28}
- 49M99 None of the above but in this section
--> Top level of Index
--> Top level of this Section