Sufficient Conditions for Nonsmoothr-Invexity
From MaRDI portal
Publication:3514745
DOI10.1080/01630560802099886zbMATH Open1154.26015OpenAlexW1971978691MaRDI QIDQ3514745FDOQ3514745
M. E. Sarabi, Majid Soleimani-Damaneh
Publication date: 23 July 2008
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630560802099886
Recommendations
- Nonsmooth invex functions and sufficient optimality conditions
- INVEXITY AS NECESSARY OPTIMALITY CONDITION IN NONSMOOTH PROGRAMS
- scientific article; zbMATH DE number 1293820
- scientific article; zbMATH DE number 409548
- \((\Phi , \rho )\)-invexity in nonsmooth optimization
- Nonasymptotic necessary conditions for nonsmooth infinite optimization problems
- Generalized Nonsmooth Invexity
- scientific article
- Generalized invexity of nonsmooth functions
- Necessary and sufficient conditions for optimality of nonsmooth semi-infinite programming
Optimality conditions and duality in mathematical programming (90C46) Convexity of real functions in one variable, generalizations (26A51)
Cites Work
- Title not available (Why is that?)
- Convex Analysis
- Techniques of variational analysis
- \((p,r)\)-invex sets and functions
- Theorems of the alternative and optimality conditions for convexlike and general convexlike programming
- Generalized (p, r)-Invexity in Mathematical Programming
- \(r\)-preinvexity and \(r\)-invexity in mathematical programming
- Nonsmooth multiobjective optimization using limiting subdifferentials
- Multiple-objective programs in Banach spaces: sufficiency for (proper) optimality
- An η-Approximation Approach for Nonlinear Mathematical Programming Problems Involving Invex Functions
- An \(\eta\)-approximation approach to duality in mathematical programming problems involving \(r\)-invex functions
Cited In (5)
- Conditioning and upper-Lipschitz inverse subdifferentials in nonsmooth optimization problems
- LIPSCHITZr-INVEX FUNCTIONS AND NONSMOOTH PROGRAMMING
- Duality for semi-infinite programming problems involving \((H_p,r)\)-invex functions
- INVEXITY AS NECESSARY OPTIMALITY CONDITION IN NONSMOOTH PROGRAMS
- Fritz John type optimality and duality in nonlinear programming under weak pseudo-invexity
This page was built for publication: Sufficient Conditions for Nonsmoothr-Invexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3514745)