Convex inequalities without constraint qualification nor closedness condition, and their applications in optimization
From MaRDI portal
(Redirected from Publication:618891)
Recommendations
- Functional Inequalities in the Absence of Convexity and Lower Semicontinuity with Applications to Optimization
- A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces
- Farkas lemma for convex systems revisited and applications to sublinear-convex optimization problems
- scientific article; zbMATH DE number 3847230
- Constraint qualifications for extended Farkas's lemmas and Lagrangian dualities in convex infinite programming
Cites work
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- scientific article; zbMATH DE number 4029251 (Why is no real title available?)
- scientific article; zbMATH DE number 1014808 (Why is no real title available?)
- scientific article; zbMATH DE number 1070896 (Why is no real title available?)
- scientific article; zbMATH DE number 3441151 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 854134 (Why is no real title available?)
- Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
- Characterizing global optimality for DC optimization problems under convex inequality constraints
- Complements on subdifferential calculus
- Dual characterizations of set containments with strict convex inequalities
- Extended Active Constraints in Linear Optimization with Applications
- Farkas-Type Results With Conjugate Functions
- Farkas-type results and duality for DC programs with convex constraints
- Inequality systems and global optimization
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Liberating the subgradient optimality conditions from constraint qualifications
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- Semi-continuous mappings in general topology
- Sequential Convex Subdifferential Calculus and Sequential Lagrange Multipliers
- Sequential Lagrangian conditions for convex programs with applications to semidefinite programming
- Some new Farkas-type results for inequality systems with DC functions
- Subdifferential calculus using -subdifferentials
- Subdifferential calculus without qualification conditions, using approximate subdifferentials: A survey
- Unilateral Analysis and Duality
Cited in
(10)- On epsilon-stability in optimization
- Farkas-type results for vector-valued functions with applications
- Functional Inequalities in the Absence of Convexity and Lower Semicontinuity with Applications to Optimization
- Farkas' lemma: three decades of generalizations for mathematical optimization
- Necessary and sufficient optimality conditions in DC semi-infinite programming
- An approximate Hahn-Banach theorem for positively homogeneous functions
- Functional inequalities and theorems of the alternative involving composite functions
- Recent contributions to linear semi-infinite optimization
- Recent contributions to linear semi-infinite optimization: an update
- Asymptotic optimality conditions for linear semi-infinite programming
This page was built for publication: Convex inequalities without constraint qualification nor closedness condition, and their applications in optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q618891)
