Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
From MaRDI portal
Publication:4197650
DOI10.1287/moor.4.1.79zbMath0409.90086OpenAlexW1966480644MaRDI QIDQ4197650
Publication date: 1979
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.4.1.79
SubdifferentialsBanach SpacesNonlinear ProgrammingLagrange MultipliersConstrained OptimizationProgramming in Abstract SpacesNecessary Optimality ConditionsTangent ConesGeneralized Gradients
Numerical methods based on necessary conditions (49M05) Normed linear spaces and Banach spaces; Banach lattices (46B99) Programming in abstract spaces (90C48) Methods of reduced gradient type (90C52) Optimality conditions for problems in abstract spaces (49K27)
Related Items (only showing first 100 items - show all)
Lipschitz properties of solutions in mathematical programming ⋮ Properties of generalized differentials ⋮ Nonlinear separation functions, optimality conditions and error bounds for Ky Fan quasi-inequalities ⋮ Nonasymptotic necessary conditions for nonsmooth infinite optimization problems ⋮ The Lipschitzianity of convex vector and set-valued functions ⋮ Some properties of generalized oriented distance function and their applications to set optimization problems ⋮ Newton-like methods for efficient solutions in vector optimization ⋮ Semidifferentiable functions and necessary optimality conditions ⋮ Metric regularity and subdifferential calculus in Banach spaces ⋮ Relationships between the oriented distance functional and a nonlinear separation functional ⋮ An implicit function theorem for directionally differentiable functions ⋮ Necessary optimality conditions for nonsmooth multi-objective bilevel optimization problem under the optimistic perspective ⋮ Uniform estimation of a convex body by a fixed-radius ball ⋮ Geoffrion type characterization of higher-order properly efficient points in vector optimization ⋮ Connectedness of solution sets for generalized vector equilibrium problems via free-disposal sets in complete metric space ⋮ Distance to ill-posedness in linear optimization via the Fenchel-Legendre conjugate ⋮ Optimality conditions for generalized Ky Fan quasi-inequalities with applications ⋮ Strict efficiency in vector optimization with nearly convexlike set-valued maps ⋮ Connectedness of solution sets of strong vector equilibrium problems with an application ⋮ Constrained extremum problems and image space analysis. I: Optimality conditions ⋮ Image space analysis for constrained inverse vector variational inequalities via multiobjective optimization ⋮ Characterizations for optimality conditions of general robust optimization problems ⋮ Optimality conditions for convex problems on intersections of non necessarily convex sets ⋮ Unified vector quasiequilibrium problems via improvement sets and nonlinear scalarization with stability analysis ⋮ Sublevel representations of epi-Lipschitz sets and other properties ⋮ Second order sufficient optimality conditions in vector optimization ⋮ Subdifferential and optimality conditions for the difference of set-valued mappings ⋮ Nonlinear separation in the image space with applications to constrained optimization ⋮ Lagrangian conditions for approximate solutions on nonconvex set-valued optimization problems ⋮ Unified duality theory for constrained extremum problems. II: Special duality schemes ⋮ Necessary optimality conditions and a new approach to multiobjective bilevel optimization problems ⋮ Lagrange multipliers in convex set optimization with the set and vector criteria ⋮ Characterizations of multiobjective robustness via oriented distance function and image space analysis ⋮ On strong tangential transversality ⋮ Generalized Kuhn-Tucker conditions and duality for continuous nonlinear programming problems ⋮ Nonlinear separation approach to constrained extremum problems ⋮ Properties of the nonlinear scalar functional and its applications to vector optimization problems ⋮ Error bound results for convex inequality systems via conjugate duality ⋮ Robustness characterizations for uncertain optimization problems via image space analysis ⋮ Hadamard well-posedness for a set-valued optimization problem ⋮ Subdifferentials of multifunctions and Lagrange multipliers for multiobjective optimization. ⋮ Generalized gradients of Lipschitz functionals ⋮ Hadamard's theorem for locally Lipschitzian maps ⋮ General constraint qualifications in nondifferentiable programming ⋮ A characterization of Hyers-Lang differentiability in terms of a tangent cone ⋮ Subdifferentials of nonconvex vector-valued functions ⋮ Scalarization of set-valued optimization problems and variational inequalities in topological vector spaces ⋮ Notes on Lipschitz properties of nonlinear scalarization functions with applications ⋮ Tangency and differentiation: Marginal functions ⋮ Some remarks on the Minty vector variational principle ⋮ On a general class of matrix nearness problems ⋮ Variational analysis on the signed distance functions ⋮ Separations and optimality of constrained multiobjective optimization via improvement sets ⋮ Implicit-function subdifferentiation formulas for Lipschitz mappings ⋮ Vector variational-like inequalities with constraints: separation and alternative ⋮ Optimality conditions and duality in terms of convexificators for multiobjective bilevel programming problem with equilibrium constraints ⋮ Optimality conditions for nonsmooth multiobjective optimization using Hadamard directional derivatives ⋮ An equivalent one level optimization problem to a semivectorial bilevel problem ⋮ Global efficiency for multiobjective bilevel programming problems under generalized invexity ⋮ Nonlinear separation concerning \(E\)-optimal solution of constrained multi-objective optimization problems ⋮ From scalar to vector optimization. ⋮ Scalarizations for a unified vector optimization problem based on order representing and order preserving properties ⋮ Condition numbers and error bounds in convex programming ⋮ Generalized \(\varepsilon \)-quasi-solutions in multiobjective optimization problems: existence results and optimality conditions ⋮ Nonlinear scalarization with applications to Hölder continuity of approximate solutions ⋮ Lagrange multipliers for \(\varepsilon \)-Pareto solutions in vector optimization with nonsolid cones in Banach spaces ⋮ Characterizing efficiency on infinite-dimensional commodity spaces with ordering cones having possibly empty interior ⋮ Stability of properly efficient points and isolated minimizers of constrained vector optimization problems ⋮ Scalarization in set optimization with solid and nonsolid ordering cones ⋮ Scalarizations and optimality of constrained set-valued optimization using improvement sets and image space analysis ⋮ Univalence and degree for Lipschitz continuous maps ⋮ Some properties of nonconvex oriented distance function and applications to vector optimization problems ⋮ Well posedness in vector optimization problems and vector variational inequalities ⋮ Continuity of solutions for parametric set optimization problems via scalarization methods ⋮ Six set scalarizations based on the oriented distance: continuity, convexity and application to convex set optimization ⋮ Optimality conditions for multiobjective optimization problem constrained by parameterized variational inequalities ⋮ Merit functions in vector optimization ⋮ Characterization of set relations through extensions of the oriented distance ⋮ On Levitin-Polyak well-posedness and stability in set optimization ⋮ Stability and regular points of inequality systems ⋮ Extended well-posedness of quasiconvex vector optimization problems ⋮ Scalarization and robustness in uncertain vector optimization problems: a non componentwise approach ⋮ Connectedness properties of the efficient sets and the nondominated sets to vector optimization problems ⋮ Scalarizations for a set optimization problem using generalized oriented distance function ⋮ Image space analysis for uncertain multiobjective optimization problems: robust optimality conditions ⋮ A unified characterization of nonlinear scalarizing functionals in optimization ⋮ Clarke's tangent vectors as tangents to Lipschitz continuous curves ⋮ Tangency and differentiation: Some applications of convergence theory ⋮ Optimality conditions in nondifferentiable programming and their applications to best approximations ⋮ New notions of proper efficiency in set optimization with the set criterion ⋮ Local convex analysis ⋮ Tangent cones and Dini derivatives ⋮ Generalized differentials of nonsmooth functions, and necessary conditions for an extremum ⋮ Lipschitzian inverse functions, directional derivatives, and applications in \(C^{1,1}\) optimization ⋮ Necessary optimality conditions for Stackelberg problems ⋮ Optimality conditions for vector optimization problems of a difference of convex mappings ⋮ On Lipschitz continuity of solutions to equilibrium problems via the Hiriart-Urruty oriented distance function ⋮ Optimality conditions for D.C. vector optimization problems under reverse convex constraints ⋮ A new approach to constrained optimization via image space analysis ⋮ Optimality conditions for quasi-solutions of vector optimization problems
This page was built for publication: Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
