Disciplined quasiconvex programming
From MaRDI portal
Publication:2228357
Abstract: We present a composition rule involving quasiconvex functions that generalizes the classical composition rule for convex functions. This rule complements well-known rules for the curvature of quasiconvex functions under increasing functions and pointwise maximums. We refer to the class of optimization problems generated by these rules, along with a base set of quasiconvex and quasiconcave functions, as disciplined quasiconvex programs. Disciplined quasiconvex programming generalizes disciplined convex programming, the class of optimization problems targeted by most modern domain-specific languages for convex optimization. We describe an implementation of disciplined quasiconvex programming that makes it possible to specify and solve quasiconvex programs in CVXPY 1.0.
Recommendations
Cites work
- A Review of Quasi-Convex Functions
- Convergence and efficiency of subgradient methods for quasiconvex minimization
- CVXPY: a Python-embedded modeling language for convex optimization
- Designing stabilizing control of uncertain systems by quasiconvex optimization
- Disciplined convex programming
- Existence of an Equilibrium for a Competitive Economy
- Fractional programming: Applications and algorithms
- scientific article; zbMATH DE number 3614491 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 3084780 (Why is no real title available?)
- On Convergence Properties of a Subgradient Method
- On von Neumann's minimax theorem
- Optimization for products of concave functions
- Programming Problems with Convex Fractional Functions
- Programming with linear fractional functionals
- Quantized Control via Locational Optimization
- Quasi-Convex Programming
- Quasiconvex programming
- The origins of quasi-concavity: a development between mathematics and economics.
Cited in
(16)- Characterization of nonsmooth quasiconvex functions and their Greenberg-Pierskalla's subdifferentials using semi-quasidifferentiability notion
- Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces
- Disciplined geometric programming
- Quasiconvex Jensen divergences and quasiconvex Bregman divergences
- Portfolio optimization with two quasiconvex risk measures
- Quasiconvex programming
- Disciplined convex programming
- Constraint reformulations for set point optimization problems using fuzzy cognitive map models
- Semistrictly and neatly quasiconvex programming using lower global subdifferentials
- Multi-period liability clearing via convex optimal control
- Transforming optimization problems into disciplined convex programming form
- Parallel algorithms for finding common solutions to split convex feasibility and quasiconvex minimization problems
- Decomposed quasiconvex optimization with application to generalized cone problems
- On quasi-convex smooth optimization problems by a comparison oracle
- Scalable approximate optimal diagonal preconditioning
- Compound optimal design of experiments - semidefinite programming formulations
This page was built for publication: Disciplined quasiconvex programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2228357)
