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