Level function method for quasiconvex programming.

DOI10.1023/A:1026446503110zbMath1041.90038OpenAlexW132884890MaRDI QIDQ5929422

Huifu Xu

Publication date: 20 August 2001

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1026446503110

Mathematics Subject Classification ID

Convex programming (90C25) Convex functions and convex programs in convex geometry (52A41)

Related Items (6)

Preference Robust Optimization for Choice Functions on the Space of CDFs ⋮ Numerical methods for stochastic programs with second order dominance constraints with applications to portfolio optimization ⋮ Penalized sample average approximation methods for stochastic programs in economic and secure dispatch of a power system ⋮ Stochastic programming with multivariate second order stochastic dominance constraints with applications in portfolio optimization ⋮ Convexity and optimization with copulæ structured probabilistic constraints ⋮ A SMOOTHING PENALIZED SAMPLE AVERAGE APPROXIMATION METHOD FOR STOCHASTIC PROGRAMS WITH SECOND-ORDER STOCHASTIC DOMINANCE CONSTRAINTS

Cites Work

• Unnamed Item
• Lower subdifferentiable functions and their minimization by cutting planes
• An outer approximation method for globally minimizing a concave function over a compact convex set
• On outer approximation methods for solving concave minimization problems
• Algorithms for generalized fractional programming
• Discrete and fractional programming techniques for location models
• New variants of bundle methods
• A globally convergent Newton method for solving strongly monotone variational inequalities
• The Cutting-Plane Method for Solving Convex Programs
• A method for globally minimizing concave functions over convex sets

This page was built for publication: Level function method for quasiconvex programming.