scientific article; zbMATH DE number 3800430

MaRDI QIDQ4744875zbMATH OpenFDO

Authors

Publication date 1982

zbMATH Keywords

minimax problemsnondifferentiable optimizationsubgradient method

Mathematics Subject Classification ID

Numerical methods based on nonlinear programming (49M37) Convex programming (90C25) Methods of reduced gradient type (90C52) Methods of successive quadratic programming type (90C55)

Cited in

(8)

• Constraint aggregation principle in convex optimization
• Separating plane algorithms for convex optimization
• A method for minimizing convex functions based on continuous approximations to the subdifferential
• Weak subgradient method for solving nonsmooth nonconvex optimization problems
• Essentials of numerical nonsmooth optimization
• Essentials of numerical nonsmooth optimization
• Synthesis of cutting and separating planes in a nonsmooth optimization method
• Numerical solutions to coupled-constraint (or generalised Nash) equilibrium problems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4744875)