Optimality and duality in nonsmooth semi-infinite optimization, using a weak constraint qualification
From MaRDI portal
Publication:2105868
DOI10.1007/s10203-022-00375-wOpenAlexW4308752100MaRDI QIDQ2105868
Giuseppe Caristi, David Barilla, Nader Kanzi
Publication date: 8 December 2022
Published in: Decisions in Economics and Finance (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10203-022-00375-w
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constraint qualifications in convex vector semi-infinite optimization
- A critical view on invexity
- On strong KKT optimality conditions for multiobjective semi-infinite programming problems with Lipschitzian data
- Necessary optimality conditions for nonsmooth semi-infinite programming problems
- Proper efficiency conditions and duality results for nonsmooth vector optimization in Banach spaces under \((\varPhi, \rho)\)-invexity
- Semi-infinite programming
- Generalized convexity and optimization. Theory and applications
- On \(G\)-invex multiobjective programming. II: Duality
- On sufficiency of the Kuhn-Tucker conditions
- Invexity and the Kuhn-Tucker theorem
- On the notion of proper efficiency in vector optimization
- Variational methods in partially ordered spaces
- Necessary and sufficient conditions for (weakly) efficient of non-differentiable multi-objective semi-infinite programming problems
- Strict lower semicontinuity of the level sets and invexity of a locally Lipschitz function
- DC programming: overview.
- Constraint qualifications in linear vector semi-infinite optimization
- Optimality conditions in convex multiobjective SIP
- Optimality conditions for nonsmooth semi-infinite multiobjective programming
- Strong and Weak Convexity of Sets and Functions
- (Φ, ρ)-Invexity in Nonsmooth Optimization
- Semi-Infinite Programming: Theory, Methods, and Applications
- LIPSCHITZr-INVEX FUNCTIONS AND NONSMOOTH PROGRAMMING
- Constraint Qualifications in Semi-Infinite Systems and Their Applications in Nonsmooth Semi-Infinite Problems with Mixed Constraints
- Optimality conditions for nondifferentiable convex semi-infinite programming
- Nonsmooth invexity
- GeneralizedB-(p,r)-Invexity Functions and Nonlinear Mathematical Programming
- Optimization and nonsmooth analysis
- Nondifferentiable optimization by smooth approximations
- What is invexity?
- Invex functions and constrained local minima
- Invex nonsmooth alternative theorem and applications*
- Optimality, scalarization and duality in linear vector semi-infinite programming
- What is quasiconvex analysis?
- Saddle point criteria and Wolfe duality in nonsmooth (Φ, ρ)-invex vector optimization problems with inequality and equality constraints
- Multicriteria Optimization
- Abstract convexity and global optimization
This page was built for publication: Optimality and duality in nonsmooth semi-infinite optimization, using a weak constraint qualification
