A global regularization method for solving the finite min-max problem

DOI10.1023/A:1018601319372MaRDI QIDQ1273527zbMATH OpenFDO

Authors Oscar Barrientos

Publication date 7 December 1998

Published in Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1018601319372

zbMATH Keywords

finite nonlinear min-max problemnondifferentiable optimizationquasi-Newton methodsregularization techniquesequence of differentiable subproblems

Mathematics Subject Classification ID

Optimality conditions for minimax problems (49K35) Nonlinear programming (90C30)

Recommendations

• A Regularization Method for Solving the Finite Convex Min-Max Problem
• scientific article; zbMATH DE number 17725
• scientific article; zbMATH DE number 653049

Cited in

(7)

• Coupling the auxiliary problem principle and epiconvergence theory to solve general variational inequalities
• scientific article; zbMATH DE number 4142758 (Why is no real title available?)
• scientific article; zbMATH DE number 17724 (Why is no real title available?)
• scientific article; zbMATH DE number 17725 (Why is no real title available?)
• Application of the penalty method to nonstationary approximation of an optimization problem
• A Regularization Method for Solving the Finite Convex Min-Max Problem
• Convergence of the approximate auxiliary problem method for solving generalized variational inequalities

This page was built for publication: A global regularization method for solving the finite min-max problem

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