Optimality conditions for convex problems on intersections of non necessarily convex sets
From MaRDI portal
Publication:2173517
DOI10.1007/s10898-019-00849-zzbMath1452.90242OpenAlexW2981555188MaRDI QIDQ2173517
Elisabetta Allevi, Rossana Riccardi, Juan-Enrique Martinez-Legaz
Publication date: 23 April 2020
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: http://ddd.uab.cat/record/224366
Convex programming (90C25) Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)
Related Items
Nonsmooth Constraint Qualifications for Nonconvex Inequality Systems, Convex optimization without convexity of constraints on non-necessarily convex sets and its applications in customer satisfaction in automotive industry, Characterizations of the solution set for tangentially convex optimization problems, A mean value theorem for tangentially convex functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On representations of the feasible set in convex optimization
- Optimality conditions in convex optimization revisited
- Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints
- Necessary and sufficient KKT optimality conditions in non-convex optimization
- Optimality conditions in optimization problems with convex feasible set using convexificators
- Optimality Conditions for Quasiconvex Programs
- Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
- Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators
- An introduction to the theory of nonsmooth optimization
- Revisiting Tietze–Nakajima: Local and Global Convexity for Maps
- Convex Analysis