Constraint qualifications in maximization problems
From MaRDI portal
Publication:5338599
DOI10.1002/nav.3800080206zbMath0129.34103OpenAlexW2006668851WikidataQ56594247 ScholiaQ56594247MaRDI QIDQ5338599
Leonid Hurwicz, Kenneth J. Arrow, Hirofumi Uzawa
Publication date: 1961
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800080206
Related Items
Necessary and sufficient KKT optimality conditions in non-convex optimization, A modified augmented Lagrangian method for a class of monotone variational inequalities, On the theory of semi‐infinite programming and a generalization of the kuhn‐tucker saddle point theorem for arbitrary convex functions, Constraint qualifications in the invex case, The Fritz John and Kuhn-Tucker optimality conditions in continuous-time nonlinear programming, A NOTE ON CONVEXITY*, Probability-one homotopy methods for constrained clustering, Constraint qualifications in nonsmooth optimization: Classification and inter-relations, Characterizing FJ and KKT Conditions in Nonconvex Mathematical Programming with Applications, On the notion of tangent cone in mathematical programming, Modified regularity conditions for nonlinear programming problems over mixed cone domains, Unnamed Item, Walrasian foundations for equilibria in segmented markets, On pseudolinear functions, Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators, Differential conditions for constrained nonlinear programming via Pareto optimization, Nonlinear programming without differentiability in banach spaces: necessary and sufficient constraint qualification, Logarithmic convexity and geometric programming, A general equilibrium analysis of strategic arbitrage, Semi-infinite programming, differentiability and geometric programming: Part II, Tchebyscheff bounds for the space of agent characteristics, Characterization of optimality in convex programming without a constraint qualification, Mathematical programming applied to linear approximation of functions, Geometry of optimality conditions and constraint qualifications: The convex case, Condizioni necessarie e sufficienti per un problema di programmazione non lineare, Optimality condition: Constraint regularization, The Fritz John necessary optimality conditions in the presence of equality and inequality constraints, The Kuhn-Tucker conditions in Banach space with an application to control theory, Duality for variational problems, A local version of Karamardian's theorem on lower semicontinuous strictly quasiconvex functions, Characterizing sustainability in discrete time, Efficiency and nonlinear pricing in nonconvex environments with externalities: A generalization of the Lindahl equilibrium concept, A duality theorem and an algorithm for (mixed-) integer nonlinear programming, Global convergence for Newton methods in mathematical programming, Necessary optimality criteria in mathematical programming in the presence of differentiability, Sparse Solutions by a Quadratically Constrained ℓq (0 <q< 1) Minimization Model, Optimality conditions and constraint qualifications in Banach space, Regularity conditions for constrained extremum problems, Equivalence of saddle-points and optima for non-concave programmes, Quasi-convex programming revisited, The nonlinear bilevel programming problem:formulations,regularity and optimality conditions, The nonlinear bilevel programming problem:formulations,regularity and optimality conditions, Pseudonormality and a Lagrange multiplier theory for constrained optimization, The envelope theorem in dynamic optimization, Geometry of optimality conditions and constraint qualifications
Cites Work
