Nonsmooth semi-infinite programming problem using limiting subdifferentials
From MaRDI portal
Publication:454252
DOI10.1007/s10898-011-9690-5zbMath1274.90442MaRDI QIDQ454252
Hoai An Le Thi, Shashi Kant Mishra, Monika Jaiswal
Publication date: 1 October 2012
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-011-9690-5
nonsmooth optimization; generalized convexity; duality; semi-infinite programming; sufficient optimality conditions
90C34: Semi-infinite programming
Related Items
New optimality conditions for nonsmooth control problems, On the stability of solutions for semi-infinite vector optimization problems, Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints, Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems, Painlevé-Kuratowski stability of approximate efficient solutions for perturbed semi-infinite vector optimization problems, Necessary optimality conditions for a multiobjective semi-infinite interval-valued programming problem, How to solve a semi-infinite optimization problem, Non-convex semi-infinite min-max optimization with noncompact sets, Connectedness of approximate efficient solutions for generalized semi-infinite vector optimization problems, Necessary optimality conditions for a nonsmooth semi-infinite programming problem, Approximate optimality conditions and mixed type duality for semi-infinite multiobjective programming problems involving tangential subdifferentials
Cites Work
- Unnamed Item
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
- Nonsmooth multiobjective optimization using limiting subdifferentials
- Semi-infinite programming
- Generalized semi-infinite programming: On generic local minimizers
- A branch-and-bound approach for solving a class of generalized semi-infinite programming problems
- A smoothing Newton method for semi-infinite programming
- Linear semi-infinite programming theory: an updated survey
- A homotopy interior point method for semi-infinite programming problems
- Generalized convexities and generalized gradients based on algebraic operations
- Nonsmooth semi-infinite programming problems with mixed constraints
- Optimality conditions for non-smooth semi-infinite programming
- Semi-Infinite Programming: Theory, Methods, and Applications
- On duality theory of convex semi-infinite programming
- Variational Analysis in Semi-Infinite and Infinite Programming, I: Stability of Linear Inequality Systems of Feasible Solutions
- Semi-infinite programming, duality, discretization and optimality conditions†
- On nondifferentiable and nonconvex vector optimization problems
