A feasible descent bundle method for inequality constrained minimax problems

DOI10.1360/N012015-00022MaRDI QIDQ5063583zbMATH OpenFDO

Authors Fei Tang, Jinbao Jian, Chun-Ming Tang

Publication date 21 March 2022

Published in SCIENTIA SINICA Mathematica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1360/N012015-00022

zbMATH Keywords

feasible descent bundle methodinequality constraintsminimax problemspartial cutting-planes model

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47)

Recommendations

• A proximal-projection partial bundle method for convex constrained minimax problems
• scientific article; zbMATH DE number 3898620
• A strongly sub-feasible norm-relaxed SQCQP algorithm for the inequality constrained minimax problems
• A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization
• A partially inexact bundle method for convex semi-infinite minmax problems

Cited in

(5)

• A feasible point method with bundle modification for nonsmooth convex constrained optimization
• A proximal-projection partial bundle method for convex constrained minimax problems
• scientific article; zbMATH DE number 5811159 (Why is no real title available?)
• A two-phase bundle method with bundle modification for nonsmooth constrained optimization
• A generalized gradient projection method based on a new working set for minimax optimization problems with inequality constraints

This page was built for publication: A feasible descent bundle method for inequality constrained minimax problems

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