Quasi-Convex Programming

From MaRDI portal
Publication:5613728

DOI10.1137/0116088zbMath0212.23905OpenAlexW1964171198MaRDI QIDQ5613728

David G. Luenberger

Publication date: 1968

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0116088



Related Items

A general theory of dual optimization problems, Duality for quasiconvex minimization over closed convex cones, A general theory of surrogate dual and perturbational extended surrogate dual optimization problems, Continuity of Optimal Solution Functions and their Conditions on Objective Functions, Sharing problems, A convex-like duality scheme for quasi-convex programs, Surrogate duality for vector optimization, The use of pseudo-convexity and quasi-convexity in sufficient conditions for global constrained extrema†, Some remarks on Greenberg-Pierskalla subdifferentiability of quasiconvex functions, Indefinite multi-constrained separable quadratic optimization: large-scale efficient solution, A duality theory for a class of non-zero sum economic games, Necessary and sufficient constraint qualification for surrogate duality, Lagrangian approach to quasiconvex programing, Generalized convexity and concavity of the optimal value function in nonlinear programming, A complete characterization of strong duality in nonconvex optimization with a single constraint, 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, Quasiconvex duality theory by generalized conjugation methods, A duality approach to minimax results for quasi-saddle functions in finite dimensions, Zero duality gap in surrogate constraint optimization: a concise review of models, Ein Beitrag zur quasi-konvexen Optimierung in topologischen linearen Räumen, Applications of symmetric derivatives in mathematical programming, Vector optimization problems with quasiconvex constraints, Multivalued convexity and optimization: A unified approach to inequality and equality constraints, Zero duality gap in integer programming: \(P\)-norm surrogate constraint method, Global saddle-point duality for quasi-concave programs, Cramér’s Theorem is Atypical, Calculating surrogate constraints, A duality theory for quasiconcave programs, Direct theorems in semi-infinite convex programming, An appreciation of Professor David G. Luenberger, Strong and total Lagrange dualities for quasiconvex programming, Strong and total Lagrange dualities for quasiconvex programming, Exact quasiconvex conjugation, Zero-one integer programs with few contraints - lower bounding theory, Smart greedy procedure for solving a multidimensional nonlinear knapsack class of reliability optimization problems., Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality, Surrogate dual problems and surrogate Lagrangians, Local-global properties of bifunctions, New optimality principles for economic efficiency and equilibrium, Surrogate duality for robust optimization, Duality for quasi-concave programs with application to economics