Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems
type: Item
instance of: scholarly article
title: Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems
zbMATH Open document ID: 1413.90298
author: X. J. Long
author: Yibin Xiao
author: Nan-Jing Huang
published in: Journal of the Operations Research Society of China
publication date: 2018-08-15T00:00:00Z
Mathematics Subject Classification ID: 90C34
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C46
zbMATH DE Number: 6918757
zbMATH Keywords: nonsmooth semi-infinite programming problem
zbMATH Keywords: optimality condition
zbMATH Keywords: approximate solution
zbMATH Keywords: generalized pseudoconvexity
MaRDI profile type: Publication
full work available at URL: s40305-017-0167-1
OpenAlex ID: W2619997648
cites work: Q4357206
cites work: Q3840143
cites work: How to solve a semi-infinite optimization problem
cites work: Calmness Modulus of Linear Semi-infinite Programs
cites work: Subdifferentials of Marginal Functions in Semi-infinite Programming
cites work: New Farkas-type constraint qualifications in convex infinite programming
cites work: Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
cites work: Semi-infinite optimization under convex function perturbations: Lipschitz stability
cites work: Constraint Qualifications in Semi-Infinite Systems and Their Applications in Nonsmooth Semi-Infinite Problems with Mixed Constraints
cites work: Q3106488
cites work: Quasi-Slater and Farkas--Minkowski Qualifications for Semi-infinite Programming with Applications
cites work: Q2953986
cites work: Nonsmooth semi-infinite programming problem using limiting subdifferentials
cites work: Subdifferentials of Nonconvex Supremum Functions and Their Applications to Semi-infinite and Infinite Programs with Lipschitzian Data
cites work: A new approach to characterize the solution set of a pseudoconvex programming problem
cites work: Q3860434
cites work: Lagrange multipliers for \(\varepsilon \)-Pareto solutions in vector optimization with nonsolid cones in Banach spaces
cites work: Existence and optimality conditions for approximate solutions to vector optimization problems
cites work: Lagrangian conditions for approximate solutions on nonconvex set-valued optimization problems
cites work: Necessary conditions for ε-optimality
cites work: ε-Optimal solutions in nondifferentiable convex programming and some related questions
cites work: \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
cites work: Optimization and nonsmooth analysis
cites work: Semismooth and Semiconvex Functions in Constrained Optimization
cites work: Approximate convexity in vector optimisation
cites work: Optimality via generalized approximate convexity and quasiefficiency
DOI: 10.1007/S40305-017-0167-1
description: scientific article; zbMATH DE number 6918757