Approximate optimality for quasi approximate solutions in nonsmooth semi-infinite programming problems, using -upper semi-regular semi-convexificators
From MaRDI portal
Publication:5865281
DOI10.2298/FIL2006073KzbMATH Open1499.90259MaRDI QIDQ5865281FDOQ5865281
Authors: Jutamas Kerdkaew, Rabian Wangkeeree, Gue Myung Lee 
Publication date: 13 June 2022
Published in: Filomat (Search for Journal in Brave)
Recommendations
- Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems
- scientific article; zbMATH DE number 7238249
- Optimality Conditions for Approximate Solutions of Nonsmooth Semi-Infinite Vector Optimization Problems
- Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data
- On optimality conditions and duality theorems for approximate solutions of nonsmooth infinite optimization problems
quasiconvexitypseudoconvexityconvexificatorapproximate optimality conditionsquasi approximate solutionsnonsmooth semi-infinite programming
Optimality conditions and duality in mathematical programming (90C46) Nonlinear programming (90C30) Semi-infinite programming (90C34)
Cites Work
- Convex Analysis
- Optimization and nonsmooth analysis
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
- Semi-infinite programming. Workshop, Cottbus, Germany, September 1996
- Title not available (Why is that?)
- Title not available (Why is that?)
- A generalized derivative for calm and stable functions
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- Hunting for a smaller convex subdifferential
- A Sharp Lagrange Multiplier Rule for Nonsmooth Mathematical Programming Problems Involving Equality Constraints
- The Linear Nonconvex Generalized Gradient and Lagrange Multipliers
- Title not available (Why is that?)
- Convexifactors, generalized convexity, and optimality conditions
- Epsilon efficiency
- Calmness modulus of linear semi-infinite programs
- Approximate quasi efficient solutions in multiobjective optimization
- How to solve a semi-infinite optimization problem
- Quasi-Slater and Farkas-Minkowski qualifications for semi-infinite programming with applications
- New Farkas-type constraint qualifications in convex infinite programming
- Necessary conditions for ε-optimality
- Optimality condition for local efficient solutions of vector equilibrium problems via convexificators and applications
- Subdifferentials of marginal functions in semi-infinite programming
- Approximate Jacobian Matrices for Nonsmooth Continuous Maps and C1-Optimization
- \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
- Characterizations of solution sets of a class of nonconvex semi-infinite programming problems
- Characterizations of nonemptiness and compactness of the set of weakly efficient solutions for convex vector optimization and applications
- Semi-infinite optimization under convex function perturbations: Lipschitz stability
- Approximate subdifferentials and applications II
- On approximate efficiency in multiobjective programming
- Title not available (Why is that?)
- Constraint qualifications in semi-infinite systems and their applications in nonsmooth semi-infinite problems with mixed constraints
- Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems
- Characterizations of the solution set for nonconvex semi-infinite programming problems
- Optimality conditions for \(\epsilon \)-quasi solutions of optimization problems via \(\epsilon \)-upper convexificators with applications
- Optimality and duality for nonsmooth minimax programming problems using convexifactor
Cited In (9)
- \(\epsilon \)-optimal solutions in nonconvex semi-infinite programs with support functions
- On approximate quasi Pareto solutions in nonsmooth semi-infinite interval-valued vector optimization problems
- Title not available (Why is that?)
- Applications of convex separable unconstrained nonsmooth optimization to numerical approximation with respect to l1- and l∞-norms
- Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data
- Approximate quasi-efficient solutions of nonsmooth multiobjective semi-infinite programming problems in terms of tangential subdifferentials
- Almost \(\varepsilon\)-quasi solutions for nonconvex semi-infinite optimization problems
- Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems
- Approximate optimality in semi infinite programming
This page was built for publication: Approximate optimality for quasi approximate solutions in nonsmooth semi-infinite programming problems, using \(\varepsilon\)-upper semi-regular semi-convexificators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5865281)
