Refinements of necessary optimality conditions in nondifferentiable programming. I
From MaRDI portal
Publication:1251190
DOI10.1007/BF01442544zbMath0389.90088OpenAlexW4244637133MaRDI QIDQ1251190
Publication date: 1979
Published in: Applied Mathematics and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01442544
Related Items
A finite dimensional extension of Lyusternik theorem with applications to multiobjective optimization, Homeomorphisms and generalized derivatives, Optimality conditions for bilevel programming problems, Extensions of subgradient calculus with applications to optimization, The exact absolute value penalty function method for identifying strict global minima of order \(m\) in nonconvex nonsmooth programming, On sufficiency of the Kuhn-Tucker conditions in nondifferentiable programming, Nonsmooth analysis of vector-valued mappings with contributions to nondifferentiable programming, Further properties of the regularity of inclusion systems, Local properties of solutions of nonsmooth variational solutions of nonsmooth variational inequalities, On optimality conditions in nonsmooth inequality constrained minimization, A General Sufficiency Theorem for Nonsmooth Nonlinear Programming, On metric regularity of multifunctions, Analysis of the Parallel Schwarz Method for Growing Chains of Fixed-Sized Subdomains: Part I, Nonsmooth invexity, Exactness of the absolute value penalty function method for nonsmooth ‐invex optimization problems, First order optimality conditions in vector optimization involving stable functions, A New Sequential Optimality Condition for Constrained Nonsmooth Optimization, Hadamard's theorem for locally Lipschitzian maps, Regularity, calmness and support principle, Discrete maximum principle for problems with lipschitzian functions, Unnamed Item, A covering theorem for set-valued mappings, Asymptotic analysis of sample average approximation for stochastic optimization problems with joint chance constraints via conditional value at risk and difference of convex functions, Generalized envelope theorems: applications to dynamic programming, 𝒱𝒰-smoothness and proximal point results for some nonconvex functions, Duality for non smooth non linear fractional multiobjective programs via (F,ρ) - convexity, Continuous approximations to generalized jacobians, A note on the generalized differentiability of mappings, (Φ, ρ)-Invexity in Nonsmooth Optimization, Stability and regular points of inequality systems, An approximate Newton method for solving non-smooth equations with infinite max functions, Homotopy method for solving mathematical programs with bounded box-constrained variational inequalities, Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs, Local convex analysis, Variational pairs and applications to stability in nonsmooth analysis., LIPSCHITZr-INVEX FUNCTIONS AND NONSMOOTH PROGRAMMING
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the inverse function theorem
- Analysis and optimization of Lipschitz continuous mappings
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- On the continuity of the minimum set of a continuous function
- An algorithmic approach to nonlinear analysis and optimization
- A constructive proof of the Kuhn-Tucker multiplier rule
- The Lagrange Multiplier Rule
- Generalized Gradients and Applications
- On optimality conditions in nondifferentiable programming
- A New Approach to Lagrange Multipliers
- Convex Analysis
