Quasi-Convex Programming
From MaRDI portal
Cited in
(45)- Zero-one integer programs with few contraints - lower bounding theory
- Surrogate dual problems and surrogate Lagrangians
- A general theory of dual optimization problems
- A general theory of surrogate dual and perturbational extended surrogate dual optimization problems
- A duality theory for a class of non-zero sum economic games
- A duality approach to minimax results for quasi-saddle functions in finite dimensions
- Local-global properties of bifunctions
- New optimality principles for economic efficiency and equilibrium
- Lagrangian approach to quasiconvex programing
- An appreciation of Professor David G. Luenberger
- Smart greedy procedure for solving a multidimensional nonlinear knapsack class of reliability optimization problems.
- Zero duality gap in integer programming: \(P\)-norm surrogate constraint method
- Duality for quasiconvex minimization over closed convex cones
- Some remarks on Greenberg-Pierskalla subdifferentiability of quasiconvex functions
- Duality theorems for convex and quasiconvex set functions
- Disciplined quasiconvex programming
- Characterizing quasiconvexity of the pointwise infimum of a family of arbitrary translations of quasiconvex functions, with applications to sums and quasiconvex optimization
- Zero duality gap in surrogate constraint optimization: a concise review of models
- Vector optimization problems with quasiconvex constraints
- Strong and total Lagrange dualities for quasiconvex programming
- Surrogate duality for robust optimization
- Indefinite multi-constrained separable quadratic optimization: large-scale efficient solution
- Cramér's theorem is atypical
- The use of pseudo-convexity and quasi-convexity in sufficient conditions for global constrained extrema†
- Continuity of optimal solution functions and their conditions on objective functions
- Exact quasiconvex conjugation
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- Sharing problems
- A convex-like duality scheme for quasi-convex programs
- Surrogate duality for vector optimization
- Generalized convexity and concavity of the optimal value function in nonlinear programming
- Quasiconvex duality theory by generalized conjugation methods
- Global saddle-point duality for quasi-concave programs
- Calculating surrogate constraints
- A duality theory for quasiconcave programs
- Direct theorems in semi-infinite convex programming
- Duality for quasi-concave programs with application to economics
- Necessary and sufficient constraint qualification for surrogate duality
- Multivalued convexity and optimization: A unified approach to inequality and equality constraints
- Ein Beitrag zur quasi-konvexen Optimierung in topologischen linearen Räumen
- A complete characterization of strong duality in nonconvex optimization with a single constraint
- Strong and total Lagrange dualities for quasiconvex programming
- Applications of symmetric derivatives in mathematical programming
- On quasi-convex smooth optimization problems by a comparison oracle
- Mas-Colell properness condition and almost convexity in nonconvex optimization
This page was built for publication: Quasi-Convex Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5613728)
