On optimality conditions for mathematical programming problems based on strong subdifferentials

Cites work

scientific article; zbMATH DE number 734930 (Why is no real title available?)
scientific article; zbMATH DE number 3272538 (Why is no real title available?)
scientific article; zbMATH DE number 3307201 (Why is no real title available?)
A subgradient projection method for quasiconvex minimization
A subgradient projection method for quasiconvex multiobjetive optimization
A two-step proximal point algorithm for nonconvex equilibrium problems with applications to fractional programming
An appropriate subdifferential for quasiconvex functions
Characterizations, dynamical systems and gradient methods for strongly quasiconvex functions
Generalized Concavity
Generalized convexity and optimization. Theory and applications
Handbook of generalized convexity and generalized monotonicity
Karush-Kuhn-Tucker type optimality condition for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
Limiting normal operator in quasiconvex analysis
Necessary conditions for constrained optimization problems with semicontinuous and continuous data
On optimality conditions for nonlinear conic programming
On strongly quasiconvex functions: existence results and proximal point algorithms
On the proximal point algorithm for strongly quasiconvex functions in Hadamard spaces
Optimality conditions under relaxed quasiconvexity assumptions using star and adjusted subdifferentials
Proximal point algorithms for quasiconvex pseudomonotone equilibrium problems
Quasi-Concave Programming
Seven kinds of monotone maps
Strong subdifferentials: theory and applications in nonconvex optimization

This page was built for publication: On optimality conditions for mathematical programming problems based on strong subdifferentials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7262529)