Nonsmooth semi-infinite programming problem using Limiting subdifferentials

Authors:
S. K. Mishra;M. Jaiswal;H. A. Le Thi
Affiliations:
Department of Mathematics, Banaras Hindu University, Varanasi, India;Department of Mathematics, Banaras Hindu University, Varanasi, India;Laboratory of Theoretical and Applied Computer Science LITA, UFR MIM, University Paul Verlaine of Metz, Metz, France
Venue:
Journal of Global Optimization
Year:
2012

Citing 8
Cited 1

Semi-infinite programming: theory, methods, and applications

SIAM Review
On nondifferentiable and nonconvex vector optimization problems

Journal of Optimization Theory and Applications
A Branch-and-Bound Approach for Solving a Class of Generalized Semi-infinite Programming Problems

Journal of Global Optimization
A Smoothing Newton Method for Semi-Infinite Programming

Journal of Global Optimization
A homotopy interior point method for semi-infinite programming problems

Journal of Global Optimization
Generalized Semi-Infinite Programming: on generic local minimizers

Journal of Global Optimization
Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs

Mathematical Programming: Series A and B - Series B - Special Issue: Well-posedness, stability and related topics
Variational Analysis in Semi-Infinite and Infinite Programming, I: Stability of Linear Inequality Systems of Feasible Solutions

SIAM Journal on Optimization

New optimality conditions for nonsmooth control problems

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we establish necessary and sufficient optimality conditions for nonsmooth semi-infinite programming problem using the powerful tool of limiting subdifferentials. We also formulate Wolfe and Mond-Weir type duals for nonsmooth semi-infinite programming problem and establish weak, strong and strict converse duality theorems for semi-infinite programming problem and the corresponding dual problems.