scientific article; zbMATH DE number 3921337
From MaRDI portal
Publication:3697667
Recommendations
Cited in
(15)- Optimality conditions for semi-infinite programming problems involving generalized convexity
- An extension of the proximal point algorithm beyond convexity
- Characterization of the weakly efficient solutions in nonsmooth quasiconvex multiobjective optimization
- Optimality conditions and constraint qualifications for quasiconvex programming
- Characterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
- A subgradient method for multiobjective optimization
- On the maximization of (not necessarily) convex functions on convex sets
- Optimality conditions under relaxed quasiconvexity assumptions using star and adjusted subdifferentials
- Characterizations of the solution set for tangentially convex optimization problems
- Proximal subgradient algorithm for a class of nonconvex bilevel equilibrium problems
- A Bregman proximal point algorithm without convexity in Banach spaces
- Proximal-type algorithms for solving nonconvex mixed multivalued quasi-variational inequality problems
- Necessary and sufficient optimality conditions for reverse quasiconvex programs
- Strongly quasiconvex functions: what we know (so far)
- Splitting proximal point algorithms for the sum of prox-convex functions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3697667)