Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems
From MaRDI portal
Publication:1660296
DOI10.1007/s40305-017-0167-1zbMath1413.90298OpenAlexW2619997648MaRDI QIDQ1660296
Xian-Jun Long, Yi-bin Xiao, Nan-Jing Huang
Publication date: 15 August 2018
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40305-017-0167-1
approximate solutionoptimality conditiongeneralized pseudoconvexitynonsmooth semi-infinite programming problem
Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34)
Related Items (14)
Some characterizations of approximate solutions for robust semi-infinite optimization problems ⋮ On \(\varepsilon\)-quasi efficient solutions for fractional infinite multiobjective optimization problems with locally Lipschitz data ⋮ Approximate optimality conditions and approximate duality theorems for nonlinear semi-infinite programming problems with uncertainty data ⋮ Approximate optimal solutions for multiobjective optimization problems with infinite constraints ⋮ On isolated/properly efficient solutions in nonsmooth robust semi-infinite multiobjective optimization ⋮ On optimality conditions and duality theorems for approximate solutions of nonsmooth infinite optimization problems ⋮ Approximate optimality conditions and mixed type duality for semi-infinite multiobjective programming problems involving tangential subdifferentials ⋮ Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty ⋮ Optimality conditions and scalarization of approximate quasi weak efficient solutions for vector equilibrium problem ⋮ On robust approximate optimal solutions for fractional semi-infinite optimization with uncertainty data ⋮ Characterizing the Solution Set for Nonconvex Semi-Infinite Programs Involving Tangential Subdifferentials ⋮ Optimality Conditions for Nonconvex Constrained Optimization Problems ⋮ Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints ⋮ Approximate optimality for quasi approximate solutions in nonsmooth semi-infinite programming problems, using ε-upper semi-regular semi-convexificators
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new approach to characterize the solution set of a pseudoconvex programming problem
- Lagrangian conditions for approximate solutions on nonconvex set-valued optimization problems
- Nonsmooth semi-infinite programming problem using limiting subdifferentials
- Semi-infinite optimization under convex function perturbations: Lipschitz stability
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
- Lagrange multipliers for \(\varepsilon \)-Pareto solutions in vector optimization with nonsolid cones in Banach spaces
- \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
- Optimality via generalized approximate convexity and quasiefficiency
- How to solve a semi-infinite optimization problem
- Existence and optimality conditions for approximate solutions to vector optimization problems
- Constraint Qualifications in Semi-Infinite Systems and Their Applications in Nonsmooth Semi-Infinite Problems with Mixed Constraints
- Approximate convexity in vector optimisation
- Subdifferentials of Marginal Functions in Semi-infinite Programming
- Optimization and nonsmooth analysis
- Necessary conditions for ε-optimality
- ε-Optimal solutions in nondifferentiable convex programming and some related questions
- Semismooth and Semiconvex Functions in Constrained Optimization
- Calmness Modulus of Linear Semi-infinite Programs
- Subdifferentials of Nonconvex Supremum Functions and Their Applications to Semi-infinite and Infinite Programs with Lipschitzian Data
- Quasi-Slater and Farkas--Minkowski Qualifications for Semi-infinite Programming with Applications
- New Farkas-type constraint qualifications in convex infinite programming
This page was built for publication: Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems
