scientific article; zbMATH DE number 3435272
From MaRDI portal
zbMath0276.90051MaRDI QIDQ4401741
W. P. Pierskalla, Harvey J. Greenberg
Publication date: 1973
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Duality for quasiconvex minimization over closed convex cones, Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems, A general theory of surrogate dual and perturbational extended surrogate dual optimization problems, Inexact subgradient methods for quasi-convex optimization problems, Convergence of inexact quasisubgradient methods with extrapolation, Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces, A parallel subgradient projection algorithm for quasiconvex equilibrium problems under the intersection of convex sets, Infimal generators and dualities between complete lattices, Surrogate duality in a branch-and-bound procedure for integer programming, Diewert-Crouzeix conjugation for general quasiconvex duality and applications, A convex-like duality scheme for quasi-convex programs, A subgradient method for equilibrium problems involving quasiconvex bifunctions, A consistent, reflexive duality framework of production: An application of quasi-concave conjugacy theory, Multiple-sets split quasi-convex feasibility problems: Adaptive subgradient methods with convergence guarantee, Characterization of the weakly efficient solutions in nonsmooth quasiconvex multiobjective optimization, Characterizations of the solution set for tangentially convex optimization problems, Characterizations of the solution set for non-essentially quasiconvex programming, An algorithm for quasiconvex equilibrium problems and asymptotically nonexpansive mappings: application to a Walras model with implicit supply-demand, Some remarks on Greenberg-Pierskalla subdifferentiability of quasiconvex functions, Characterizations of solution sets of differentiable quasiconvex programming problems, Necessary and sufficient constraint qualification for surrogate duality, Semistrictly and neatly quasiconvex programming using lower global subdifferentials, Optimality conditions under relaxed quasiconvexity assumptions using star and adjusted subdifferentials, Lagrangian approach to quasiconvex programing, Evenly convex sets, and evenly quasiconvex functions, revisited, A mean value theorem for tangentially convex functions, Variational analysis for the consumer theory, Lexicographical order, lexicographical index, and linear operators, Unnamed Item, Duality theorems for convex and quasiconvex set functions, Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods, The lower semi-continuous quasi-convex hull as a normalized second conjugate, A duality approach to minimax results for quasi-saddle functions in finite dimensions, Duality theorems for quasiconvex programming with a reverse quasiconvex constraint, Lower subdifferentiability of quadratic functions, Conjugate functionals and level sets, Critical duality, Unnamed Item, Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions, Conjugacy in quasi-convex programming, Set containment characterization with strict and weak quasiconvex inequalities, Some relationships between lagrangian and surrogate duality in integer programming, Karush-Kuhn-Tucker type optimality condition for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential, Subdifferential calculus for a quasiconvex function with generator, Are dualities appropriate for duality theories in optimization?, Optimality conditions and constraint qualifications for quasiconvex programming, Fixed point quasiconvex subgradient method, Characterization of nonsmooth quasiconvex functions and their Greenberg-Pierskalla's subdifferentials using semi-quasidifferentiability notion, Unnamed Item, Simple and fast surrogate constraint heuristics for the maximum independent set problem, Bounding a class of nonconvex linearly-constrained resource allocation problems via the surrogate dual, Duality theorems for certain programs involving minimum or maximum operations, Abstract convergence theorem for quasi-convex optimization problems with applications, Global saddle-point duality for quasi-concave programs, Calculating surrogate constraints, A general theory of dual optimization problems. II: On the perturbational dual problem corresponding to an unperturbational dual problem, Quasi-convex feasibility problems: subgradient methods and convergence rates, Set containment characterization for quasiconvex programming, A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem, Convergence rates of subgradient methods for quasi-convex optimization problems, Algorithms for the quasiconvex feasibility problem, Strong and total Lagrange dualities for quasiconvex programming, Strong and total Lagrange dualities for quasiconvex programming, Optimal price-threshold control for battery operation with aging phenomenon: a quasiconvex optimization approach, Exact quasiconvex conjugation, Incremental Quasi-Subgradient Method for Minimizing Sum of Geodesic Quasi-Convex Functions on Riemannian Manifolds with Applications, The structure of variational preferences, Conjugaison par tranches, Characterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential, Quasiconjugates of functions, duality relationship between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint, and applications, Surrogate dual problems and surrogate Lagrangians, Global saddle-point duality for quasi-concave programs, II, Surrogate duality for robust optimization, Duality for quasi-concave programs with application to economics, Blackwell's informativeness ranking with uncertainty-averse preferences
