On optimality conditions in nondifferentiable programming
From MaRDI portal
Publication:4152352
DOI10.1007/BF01588951zbMath0373.90071OpenAlexW2034145183MaRDI QIDQ4152352
Publication date: 1978
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01588951
Related Items (73)
A finite dimensional extension of Lyusternik theorem with applications to multiobjective optimization ⋮ Homeomorphisms and generalized derivatives ⋮ Necessary optimality conditions in terms of convexificators in Lipschitz optimization ⋮ Exact penalty functions and stability in locally Lipschitz programming ⋮ A Derivative-Free Approach to Constrained Multiobjective Nonsmooth Optimization ⋮ Superlinear convergence of a trust region type successive linear programming method ⋮ 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 ⋮ On a nonseparable convex maximization problem with continuous Knapsack constraints ⋮ Solvability results for sublinear functions and operators ⋮ Nonsmooth analysis of vector-valued mappings with contributions to nondifferentiable programming ⋮ Global invertibility of nonsmooth mappings ⋮ Nonsmooth Invexity in Multiobjective Programming ⋮ On optimality conditions in nonsmooth inequality constrained minimization ⋮ Nonsmooth invexity ⋮ Mixed Lagrange function in minimax fractional programming problems ⋮ Exactness of the absolute value penalty function method for nonsmooth ‐invex optimization problems ⋮ A geometric approach to nonsmooth optimization with sample applications ⋮ First–order cone apporximations and necessary optimality conditions ⋮ A New Sequential Optimality Condition for Constrained Nonsmooth Optimization ⋮ Hadamard's theorem for locally Lipschitzian maps ⋮ Saddle point criteria in multiobjective fractional programming involving exponential invexity ⋮ Regularity, calmness and support principle ⋮ On the Caratheodory-John multiplier rule ⋮ KKT conditions for weak\(^\ast\) compact convex sets, theorems of the alternative, and optimality conditions ⋮ General constraint qualifications in nondifferentiable programming ⋮ Multiplier rules and the separation of convex sets ⋮ Local second-order approximations and applications in optimization ⋮ Allocating procurement to capacitated suppliers with concave quantity discounts ⋮ Optimality and duality for multiobjective fractional programming involving nonsmooth pseudoinvex functions ⋮ Optimality and duality for multiobjective fractional programming involving nonsmooth generalized \((\mathcal F, b, \phi, \rho, \theta)\)-univex functions ⋮ Unnamed Item ⋮ Abstract cone approximations and generalized differentiability in nonsmooth optimization ⋮ Three types dual model for minimax fractional programming ⋮ Optimality and duality for multiobjective fractional programming involving nonsmooth($si:F$esi:ρ)–convex functions ⋮ Simplex-inspired algorithms for solving a class of convex programming problems ⋮ Optimality conditions for nonconvex nonsmooth optimization via global derivatives ⋮ Optimality conditions and duality for nondifferentiable multiobjective fractional programming with generalized convexity ⋮ A better insight into the generalized gradient of the absolute value of a function ⋮ On constraint qualifications in nonlinear programming ⋮ Solving knapsack problems with \(S\)-curve return functions ⋮ Nonsmooth \(\rho - (\eta , \theta )\)-invexity in multiobjective programming problems ⋮ Nonsmooth invex functions and sufficient optimality conditions ⋮ Greedy approaches for a class of nonlinear generalized assignment problems ⋮ Duality for non smooth non linear fractional multiobjective programs via (F,ρ) - convexity ⋮ Generalized convexity in nondifferentiable programming ⋮ Second-order necessary conditions in locally Lipschitz optimization with inequality constraints ⋮ Saddlepoint Problems in Nondifferentiable Programming ⋮ The stochastic transportation problem with single sourcing ⋮ Invexity: an updated survey and new results for nonsmooth functions ⋮ Univalence and degree for Lipschitz continuous maps ⋮ A polynomial time algorithm for convex cost lot-sizing problems ⋮ The newsvendor problem with capacitated suppliers and quantity discounts ⋮ First and second order conditions for a class of nondifferentiable optimization problems ⋮ On conditions to have bounded multipliers in locally lipschitz programming ⋮ Refinements of necessary optimality conditions in nondifferentiable programming. I ⋮ (Φ, ρ)-Invexity in Nonsmooth Optimization ⋮ Optimality and duality for generalized fractional programming involving nonsmooth \((F,\rho)\)-convex functions ⋮ An introduction to the theory of nonsmooth optimization ⋮ Approximate first-order and second-order directional derivatives of a marginal function in convex optimization ⋮ \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints ⋮ Optimality and duality for nonsmooth multiobjective fractional programming problems involving exponential \(V\)-\(r\)-invexity ⋮ Necessary and sufficient conditions for weak efficiency in non-smooth vectorial optimization problems ⋮ Generalized invexity for nonsmooth vector-valued mappings ⋮ Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints ⋮ The boundedness of the Lagrange multipliers set and duality in mathematical programming ⋮ Clarke's tangent vectors as tangents to Lipschitz continuous curves ⋮ Optimality conditions in nondifferentiable programming and their applications to best approximations ⋮ Protoconvex functions ⋮ Local convex analysis ⋮ Constraint qualifications in nonsmooth multiobjective optimization ⋮ LIPSCHITZr-INVEX FUNCTIONS AND NONSMOOTH PROGRAMMING ⋮ Knapsack problems with sigmoid utilities: approximation algorithms via hybrid optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- Lectures on mathematical theory of extremum problems. Translated from the Russian by D. Louvish
- On the cones of tangents with applications to mathematical programming
- Generalized Gradients and Applications
- A New Approach to Lagrange Multipliers
- Nonlinear Programming in Banach Space
- Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
- Convex Analysis
- A Necessary and Sufficient Qualification for Constrained Optimization
This page was built for publication: On optimality conditions in nondifferentiable programming
