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)
On a theorem of Ky Fan and its application to nondifferentiame optimization ⋮ Continuity of a scalarization in vector optimization with variable ordering structures and application to convergence of minimal solutions ⋮ A new scalarization approach and applications in set optimization ⋮ Necessary optimality conditions for two-stage stochastic programming problems ⋮ Pareto Optimizing and Kuhn–Tucker Stationary Sequences ⋮ Quasi-concave functions and convex convergence to infinity ⋮ First and second order optimality conditions in vector optimization problems with nontransitive preference relation ⋮ Integration of subdifferentials of nonconvex functions ⋮ Well-posedness and scalarization in set optimization involving ordering cones with possibly empty interior ⋮ Characterization of duality for a generalized quasi-equilibrium problem ⋮ Tangent Cones and Quasi-Interiorly Tangent Cones to Multifunctions ⋮ Systematization of problems on ball estimates of a convex compactum ⋮ Vector network equilibrium problems with capacity constraints of arcs and nonlinear scalarization methods ⋮ Characterizations of set relations with respect to variable domination structures via oriented distance function ⋮ Quasi-interiorly e-tangent cones to multifunctions ⋮ Nonsmooth analysis of vector-valued mappings with contributions to nondifferentiable programming ⋮ Lipschitzian stability of constraint systems and generalized equations ⋮ Nonsmooth analysis on partially ordered vector spaces: the subdifferential theory ⋮ A kind of equivalence of three nonlinear scalarization functions in vector optimization ⋮ Limit properties of distance functions via semigroup techniques ⋮ Image space analysis for set optimization problems with applications ⋮ A set scalarization function and Dini directional derivatives with applications in set optimization problems ⋮ Necessary optimality conditions for nonsmooth robust optimization problems ⋮ Convergence of a Dinkelbach-type algorithm in generalized fractional programming ⋮ Upper DSL approximates and nonsmooth optimization ⋮ Quasimonotone Multifunctions; Applications to Optimality Conditions in Quasiconvex Programming ⋮ On the generalized Jacobian of the inverse of a Lipschitzian mapping ⋮ Characterizations of set order relations and nonlinear scalarizations via generalized oriented distance function in set optimization ⋮ A geometric approach to nonsmooth optimization with sample applications ⋮ Optimality Conditions for Multiobjective Optimization Problems via Image Space Analysis ⋮ Isotone tangent cones and nonsmooth optimization ⋮ Characterizations of multi-objective robustness solutions defined by Minkowski set difference ⋮ Optimality and error bound for set optimization with application to uncertain multi-objective programming ⋮ Scalarization of Set-Valued Optimization Problems in Normed Spaces ⋮ On the notion of tangent cone in mathematical programming ⋮ Existence and optimality conditions for approximate solutions to vector optimization problems ⋮ Necessary and sufficient optimality conditions for fractional multi-objective problems ⋮ Asymptotic analysis of scalarization functions and applications ⋮ \(\varepsilon\)-subdifferentials of set-valued maps and \(\varepsilon\)-weak Pareto optimality for multiobjective optimization ⋮ Approximate properly solutions of constrained vector optimization with variable coradiant sets ⋮ Continuity of the solution set mappings for parametric unified weak quasivariational inequalities via free-disposal set mappings ⋮ Unnamed Item ⋮ Scalarization in geometric and functional vector optimization revisited ⋮ Regularity, calmness and support principle ⋮ On Lagrance-Kuhn-Tucker Mulitipliers for Muliobjective Optimization Problems ⋮ Optimality conditions in terms of convexificators for a bilevel multiobjective optimization problem ⋮ Nonlinear separation functions and constrained extremum problems ⋮ Unnamed Item ⋮ Abstract cone approximations and generalized differentiability in nonsmooth optimization ⋮ Compactly epi-lipschitzian sets and a-subdifferentials in wt-spaces ⋮ A set scalarization function based on the oriented distance and relations with other set scalarizations ⋮ Necessary optimality conditions for a bilevel multiobjective programming problem via a Ψ-reformulation ⋮ A better insight into the generalized gradient of the absolute value of a function ⋮ Limiting behaviour of the approximate first order and second order directional derivatives for a convex function ⋮ Nonlinear separation methods and applications for vector equilibrium problems using improvement sets ⋮ Optimality conditions for maximizations of set-valued functions ⋮ Which subgradients have sum formulas? ⋮ Optimality conditions for maximizations of set-valued functions ⋮ Quasi-convex functions and applications to optimality conditions in nonlinear programming ⋮ Prescribing tangent hyperplanes to $C^{1,1}$ and $C^{1,\omega}$ convex hypersurfaces in Hilbert and superreflexive Banach spaces ⋮ Saddlepoint Problems in Nondifferentiable Programming ⋮ First-order optimality conditions in set-valued optimization ⋮ Hölder continuity results for nonconvex parametric generalized vector quasiequilibrium problems via nonlinear scalarizing functions ⋮ A new nonlinear scalarization function and applications ⋮ Equilibria of set-valued maps: A variational approach ⋮ On nonlocal Cauchy problems for constrained differential inclusions in Euclidean space ⋮ Hölder Continuity for Solution Mappings of Parametric Non-convex Strong Generalized Ky Fan Inequalities ⋮ Convex Subcones of the Contingent Cone in Nonsmooth Calculus and Optimization ⋮ Clarke's tangent cones and the boundaries of closed sets in Rn ⋮ Approximate proper efficiency in vector optimization ⋮ Six set scalarizations based on the oriented distance: properties and application to set optimization ⋮ Characterizations of multiobjective robustness on vectorization counterparts ⋮ Sensitivity analysis using the tangent derivative ⋮ Two Set Scalarizations Based on the Oriented Distance with Variable Ordering Structures: Properties and Application to Set Optimization ⋮ Sufficient optimality conditions and duality results for a bilevel multiobjective optimization problem via a Ψ reformulation ⋮ On Lagrange Multiplier Rules for Set-Valued Optimization Problems in the Sense of Set Criterion ⋮ Tangential approximations ⋮ Extension of Lipschitz functions ⋮ Mean value theorems in nonsmooth analysis ⋮ Optimality conditions of a set valued optimization problem with the help of directional convexificators ⋮ Nonsmooth Analysis: Differential Calculus of Nondifferentiable Mappings ⋮ Directional Derivative Calculus and Optimality Conditions in Nonsmooth Mathematical Programming ⋮ Set Relations via Families of Scalar Functions and Approximate Solutions in Set Optimization ⋮ Gap functions and error bounds for weak vector variational inequalities ⋮ A characterization of tangential regularity ⋮ An Oriented Distance Function Application to Gap Functions for Vector Variational Inequalities ⋮ Characterization of Clarke's tangent and normal cones in finite and infinite dimensions ⋮ Isolated minimizers and proper efficiency for \(C^{0,1}\) constrained vector optimization problems ⋮ Characterizing an optimal input in perturbed convex programming ⋮ Characterization of solutions of multiobjective optimization problem ⋮ Optimality conditions for efficient solutions of nonconvex constrained multiobjective optimization problems via image space analysis ⋮ Unnamed Item ⋮ Second-order conditions in \(C^{1,1}\) constrained vector optimization ⋮ Existence of Lagrange multipliers for set optimization with application to vector equilibrium problems ⋮ Some characterizations of a nonlinear scalarizing function via oriented distance function ⋮ Connectedness of the approximate solution sets for set optimization problems ⋮ Steepest descent methods for critical points in vector optimization problems ⋮ On subdifferentials of a minimal time function in Hausdorff topological vector spaces ⋮ Lipschitzian properties of multifunctions ⋮ Lipschitz properties of solutions in mathematical programming
This page was built for publication: Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
