Characterizing the Solution Set for Nonconvex Semi-Infinite Programs Involving Tangential Subdifferentials
From MaRDI portal
Publication:4985185
DOI10.1080/01630563.2021.1873366zbMath1470.90095OpenAlexW3121191044MaRDI QIDQ4985185
Xian-Jun Long, Juan Liu, Nan-Jing Huang
Publication date: 22 April 2021
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630563.2021.1873366
Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34)
Related Items (11)
Nonsmooth Constraint Qualifications for Nonconvex Inequality Systems ⋮ Some characterizations of approximate solutions for robust semi-infinite optimization problems ⋮ Characterizations of the solution set for tangentially convex optimization problems ⋮ Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials ⋮ On \(\varepsilon\)-quasi efficient solutions for fractional infinite multiobjective optimization problems with locally Lipschitz 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 ⋮ Unnamed Item ⋮ Unnamed Item
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
- Semi-infinite optimization under convex function perturbations: Lipschitz stability
- On the stability of solutions for semi-infinite vector optimization problems
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
- On characterizing the solution sets of pseudoinvex extremum problems
- Characterizations of optimal solution sets of convex infinite programs
- A simple characterization of solutions sets of convex programs
- Characterization of solution sets of quasiconvex programs
- 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
- Optimality conditions for semi-infinite programming problems involving generalized convexity
- Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
- On characterizing the solution sets of pseudolinear programs
- Characterizations of the solution set for a class of nonsmooth optimization problems
- Characterizing the solution set of convex optimization problems without convexity of constraints
- Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems
- Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints
- Characterizations of solution sets of differentiable quasiconvex programming problems
- Some characterizations of robust optimal solutions for uncertain fractional optimization and applications
- Characterization of solution sets of convex programs
- Constraint Qualifications in Semi-Infinite Systems and Their Applications in Nonsmooth Semi-Infinite Problems with Mixed Constraints
- Strong Karush–Kuhn–Tucker optimality conditions for multiobjective semi-infinite programming via tangential subdifferential
- On constraint qualifications in directionally differentiable multiobjective optimization problems
- Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty
- Subdifferentials of Nonconvex Supremum Functions and Their Applications to Semi-infinite and Infinite Programs with Lipschitzian Data
- New Farkas-type constraint qualifications in convex infinite programming
- Dini derivatives in optimization — Part I
This page was built for publication: Characterizing the Solution Set for Nonconvex Semi-Infinite Programs Involving Tangential Subdifferentials
