scientific article; zbMATH DE number 3898620

zbMATH Open0563.90082MaRDI QIDQ3677518FDOQ3677518

Authors Krzysztof C. Kiwiel

Publication date 1983

zbMATH Keywords

inequality constraintsminimax problemGlobal convergencenondifferentiable functionfeasible point methodspointwise maximum of a finite collection of continuously differentiable functionsstepsize procedures

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Methods of successive quadratic programming type (90C55) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Optimality conditions for minimax problems (49K35)

Recommendations

• scientific article; zbMATH DE number 58789
• An algorithm for solving linearly constrained minimax problems
• The method of feasible directions for minimax problems
• A direct method of linearization for continuous minimax problems
• An interior-point algorithm for nonlinear minimax problems

Cited in

(8)

• A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods
• Survey Descent: A Multipoint Generalization of Gradient Descent for Nonsmooth Optimization
• On the rate of convergence of two minimax algorithms
• A feasible descent bundle method for inequality constrained minimax problems
• A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization
• scientific article; zbMATH DE number 58789 (Why is no real title available?)
• A direct method of linearization for continuous minimax problems
• scientific article; zbMATH DE number 3844952 (Why is no real title available?)

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 Q3677518)