Optimality conditions for minimax optimization problems with an infinite number of constraints and related applications

DOI10.1007/s10255-021-1019-7OpenAlexW3173810859MaRDI QIDQ2025164

Yuanfeng Jin, Li Nan Zhong

Publication date: 11 May 2021

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-021-1019-7

zbMATH Keywords

approximate solutionsmultiobjective optimizationlimiting subdifferentialsemi-infinite optimizationminimax programming problem

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34) Duality theory (optimization) (49N15)

Related Items (2)

Unnamed Item ⋮ On Minimax Fractional Semi-Infinite Programming Problems with Applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new approach to characterize the solution set of a pseudoconvex programming problem
• Nondifferentiable minimax fractional programming in complex spaces with parametric duality
• Isolated and proper efficiencies in semi-infinite vector optimization problems
• Optimality conditions and duality in nonsmooth multiobjective optimization problems
• Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data
• Second order duality for nondifferentiable minimax programming problems with generalized convexity
• Optimality conditions for a nondifferentiable minimax programming in complex spaces
• \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
• Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
• On minimax fractional optimality conditions with invexity
• Duality for a class of minmax and inexact programming problem
• On quasi \(\epsilon\)-solution for robust convex optimization problems
• Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs
• Recent contributions to linear semi-infinite optimization: an update
• Solving fractional multicriteria optimization problems with sum of squares convex polynomial data
• Nondifferentiable fractional semi-infinite multiobjective optimization problems
• On the variational principle
• An approach to \(\epsilon\)-duality theorems for nonconvex semi-infinite multiobjective optimization problems
• Nonsmooth semi-infinite multiobjective optimization problems
• Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials
• Optimality conditions in convex optimization with locally Lipschitz constraints
• Nondifferentiable minimax programming problems with applications
• Subdifferentials of Marginal Functions in Semi-infinite Programming
• Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
• Duality for Fractional Minimax Programming^∗∗The research is partly supported by NSC, Taiwan.$ef:
• Variational Analysis and Applications
• Constraint qualifications for nonsmooth programming
• Multicriteria Optimization
• New Farkas-type constraint qualifications in convex infinite programming

This page was built for publication: Optimality conditions for minimax optimization problems with an infinite number of constraints and related applications