Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
From MaRDI portal
(Redirected from Publication:3608976)
Recommendations
- Constraint qualification for quasiconvex inequality system with applications in constraint optimization
- On Constraint Qualification for an Infinite System of Convex Inequalities in a Banach Space
- Constraint qualifications for semi-infinite systems of convex inequalities
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
- On constraint qualifications of a nonconvex inequality
Cited in
(only showing first 100 items - show all)- Necessary optimality conditions for countably infinite Lipschitz problems with equality constraint mappings
- An extension of the basic constraint qualification to nonconvex vector optimization problems
- On constraint qualifications in nonlinear programming
- A note on nonconvex minimax theorem with separable homogeneous polynomials
- A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials
- On \(\varepsilon\)-quasi efficient solutions for fractional infinite multiobjective optimization problems with locally Lipschitz data
- Sandwich theorem for quasiconvex functions and its applications
- On -solutions for convex optimization problems with uncertainty data
- Constraint qualifications and Farkas lemma in convex infinite programming
- Normal subdifferentials of efficient point multifunctions in parametric vector optimization
- Some relationships among the constraint qualifications for Lagrangian dualities in DC infinite optimization problems
- scientific article; zbMATH DE number 5662944 (Why is no real title available?)
- Sufficient Optimality Conditions for a Robust Multiobjective Problem
- Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators
- Necessary and sufficient conditions for some constraint qualifications in quasiconvex programming
- Isolated and proper efficiencies in semi-infinite vector optimization problems
- Normal regularity for the feasible set of semi-infinite multiobjective optimization problems with applications
- Applying convexificators in nonsmooth multiobjective semi-infinite fractional interval-valued optimization
- On set containment characterization and constraint qualification for quasiconvex programming
- Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces
- Necessary and sufficient constraint qualification for surrogate duality
- Duality theorems for quasiconvex programming with a reverse quasiconvex constraint
- Minimizing the difference of two quasiconvex functions over a vector-valued quasiconvex system
- On basic constraint qualifications for infinite system of convex Inequalities in Banach spaces
- Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
- Optimality conditions of Fenchel-Lagrange duality and Farkas-type results for composite DC infinite programs
- scientific article; zbMATH DE number 6453520 (Why is no real title available?)
- scientific article; zbMATH DE number 7347532 (Why is no real title available?)
- The FM and BCQ Qualifications for Inequality Systems of Convex Functions in Normed Linear Spaces
- On constraint qualifications of a nonconvex inequality
- Necessary and sufficient conditions for optimality of nonsmooth semi-infinite programming
- Derivatives of the efficient point multifunction in parametric vector optimization problems
- Tight SDP relaxations for a class of robust SOS-convex polynomial programs without the Slater condition
- Necessary optimality conditions for nonsmooth semi-infinite programming problems
- On approximate solutions for robust convex semidefinite optimization problems
- On several types of basic constraint qualifications via coderivatives for generalized equations
- Karush-Kuhn-Tucker type optimality condition for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
- Duality for robust linear infinite programming problems revisited
- Robust constrained best approximation with nonconvex constraints
- Optimality conditions for minimax optimization problems with an infinite number of constraints and related applications
- scientific article; zbMATH DE number 7358881 (Why is no real title available?)
- scientific article; zbMATH DE number 7270290 (Why is no real title available?)
- Optimality conditions of robust convex multiobjective optimization via -constraint scalarization and image space analysis
- Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets
- Local optimality conditions and local saddle point theorems for nonconvex robust programming
- Duality theorems for separable convex programming without qualifications
- Optimality conditions and the basic constraint qualification for quasiconvex programming
- Karush-Kuhn-Tucker optimality conditions for non-smooth geodesic quasi-convex optimization on Riemannian manifolds
- Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data
- On global error bounds for convex inequalities systems
- Alternative KKT conditions for (semi)infinite convex optimization
- Constraint qualifications in convex vector semi-infinite optimization
- Constraint Qualifications and Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
- Optimality conditions and total Lagrange dualities for evenly convex optimization problems
- On \(\epsilon\)-solutions for robust semi-infinite optimization problems
- On Constraint Qualification for an Infinite System of Convex Inequalities in a Banach Space
- Fuzzy and exact necessary optimality conditions for a nonsmooth bilevel semi-infinite program
- Strong and total Fenchel dualities for robust convex optimization problems
- Some constraint qualifications for quasiconvex vector-valued systems
- Characterizations of robust solution set of convex programs with uncertain data
- Duality theorems for convex and quasiconvex set functions
- Constraint qualification for quasiconvex inequality system with applications in constraint optimization
- Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications
- Robust optimization revisited via robust vector Farkas lemmas
- Necessary optimality conditions for nonsmooth multiobjective bilevel programs using the Drummond-Svaiter functional
- A new tour on the subdifferential of the supremum function
- Multi-objective optimization problems with SOS-convex polynomials over an LMI constraint
- Abadie constraint qualifications for convex constraint systems and applications to calmness property
- Duality for constrained robust sum optimization problems
- Total Lagrange duality for DC infinite optimization problems
- Duality for the robust sum of functions
- Fréchet subdifferentials of efficient point multifunctions in parametric vector optimization
- Optimality conditions and total dualities for conic programming involving composite function
- Valid inequalities for separable concave constraints with indicator variables
- Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs
- Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
- On constraint qualifications for an infinite system of quasiconvex inequalities
- Sequential efficiency optimality conditions for robust multiobjective fractional optimization problems
- Recent contributions to linear semi-infinite optimization
- Nonsmooth constraint qualifications for nonconvex inequality systems
- Clarke coderivatives of efficient point multifunctions in parametric vector optimization
- Robust Farkas-Minkowski constraint qualification for convex inequality system under data uncertainty
- Optimality conditions for non-smooth semi-infinite programming
- Strong and total Lagrange dualities for quasiconvex programming
- On optimality conditions and duality theorems for approximate solutions of nonsmooth infinite optimization problems
- Generators and constraint qualifications for quasiconvex inequality systems
- Formulas and applications for the normal cone to the solution set of an infinite convex inequality system with a constraint
- Moreau--Rockafellar-Type Formulas for the Subdifferential of the Supremum Function
- On constraint qualification for an infinite system of quasiconvex inequalities in normed linear space
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- Constraint qualifications for semi-infinite systems of convex inequalities
- Optimality conditions and constraint qualifications for quasiconvex programming
- Nonsmooth semi-infinite multiobjective optimization problems
- Recent contributions to linear semi-infinite optimization: an update
- On approximate solutions for robust semi-infinite multi-objective convex symmetric cone optimization
- Fréchet BCQ and error bounds for a system of finitely many inequalities
- Extended Farkas's lemmas and strong dualities for conic programming involving composite functions
- Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs
This page was built for publication: Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608976)
