Level function method for quasiconvex programming.
From MaRDI portal
Recommendations
Cites work
- A globally convergent Newton method for solving strongly monotone variational inequalities
- A method for globally minimizing concave functions over convex sets
- Algorithms for generalized fractional programming
- An outer approximation method for globally minimizing a concave function over a compact convex set
- Discrete and fractional programming techniques for location models
- scientific article; zbMATH DE number 757682 (Why is no real title available?)
- Lower subdifferentiable functions and their minimization by cutting planes
- New variants of bundle methods
- On outer approximation methods for solving concave minimization problems
- The Cutting-Plane Method for Solving Convex Programs
Cited in
(11)- Computing the level set convex hull
- Penalized sample average approximation methods for stochastic programs in economic and secure dispatch of a power system
- Level functions of some optimal value functions.
- Convexity and optimization with copulæ structured probabilistic constraints
- A smoothing penalized sample average approximation method for stochastic programs with second-order stochastic dominance constraints
- Numerical methods for stochastic programs with second order dominance constraints with applications to portfolio optimization
- Preference Robust Optimization for Choice Functions on the Space of CDFs
- Quasiconvex programming
- scientific article; zbMATH DE number 2206826 (Why is no real title available?)
- Quasiconvex functions: how to separate, if you must!
- Stochastic programming with multivariate second order stochastic dominance constraints with applications in portfolio optimization
This page was built for publication: Level function method for quasiconvex programming.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5929422)