49Mxx Methods of successive approximations, {For discrete problems, See 90Cxx; See also 65Kxx} ( 1 Dok. )

• 49M05 Methods based on necessary conditions ( 0 Dok. )
• 49M07 Gradient methods ( 0 Dok. )
• 49M10 Methods of steepest descent type ( 0 Dok. )
• 49M15 Methods of Newton-Raphson, Galerkin and Ritz types ( 0 Dok. )
• 49M20 Methods of relaxation type ( 0 Dok. )
• 49M25 Finite difference methods ( 1 Dok. )
• 49M27 Decomposition methods ( 0 Dok. )
• 49M29 Multiplier methods ( 0 Dok. )
• 49M30 Other methods, not based on necessary conditions (penalty function, etc.) ( 0 Dok. )
• 49M35 Methods of linear programming type, See also {90C05} ( 0 Dok. )
• 49M37 Nonlinear programming, See also {90C30} ( 0 Dok. )
• 49M39 Semi-infinite programming, See also {90C34} ( 0 Dok. )
• 49M40 Methods of quadratic programming type, See also {90C20} ( 0 Dok. )
• 49M45 Methods of convex programming type, See also {90C25} ( 0 Dok. )
• 49M49 Geometric programming, See also {90C28} ( 0 Dok. )
• 49M99 None of the above but in this section ( 0 Dok. )