Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints
From MaRDI portal
Publication:2355322
DOI10.1007/s11590-014-0822-yzbMath1356.90108OpenAlexW2067945915MaRDI QIDQ2355322
Publication date: 22 July 2015
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: http://ddd.uab.cat/record/185586
Related Items
Necessary and sufficient KKT optimality conditions in non-convex optimization, Nonsmooth Constraint Qualifications for Nonconvex Inequality Systems, Robustness in nonsmooth nonconvex optimization problems, The DTC (difference of tangentially convex functions) programming: optimality conditions, Convex optimization without convexity of constraints on non-necessarily convex sets and its applications in customer satisfaction in automotive industry, Lagrange multiplier characterizations of constrained best approximation with nonsmooth nonconvex constraints, Optimality conditions for convex problems on intersections of non necessarily convex sets, Optimality conditions in optimization problems with convex feasible set using convexificators, Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation, 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, Characterizing the solution set of convex optimization problems without convexity of constraints, Optimality conditions for MPECs in terms of directional upper convexifactors, On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm, On multiobjective bilevel optimization using tangential subdifferentials, Approximate optimality conditions and mixed type duality for semi-infinite multiobjective programming problems involving tangential subdifferentials, A mean value theorem for tangentially convex functions, Unnamed Item, ϵ-Efficient solutions in semi-infinite multiobjective optimization, Error bounds for inequality systems defining convex sets, Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators, Optimality conditions for nonconvex problems over nearly convex feasible sets, Unnamed Item, Karush-Kuhn-Tucker Optimality Conditions and Duality for Multiobjective Semi-Infinite Programming Via Tangential Subdifferentials, Characterizing the Solution Set for Nonconvex Semi-Infinite Programs Involving Tangential Subdifferentials, Optimality Conditions for Nonconvex Constrained Optimization Problems, Unnamed Item, Semi-quasidifferentiability in nonsmooth nonconvex multiobjective optimization, Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints
Cites Work
