On optimality conditions in nondifferentiable programming

Cites work

A Necessary and Sufficient Qualification for Constrained Optimization
A New Approach to Lagrange Multipliers
Convex Analysis
Generalized Gradients and Applications
Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
scientific article; zbMATH DE number 3532745 (Why is no real title available?)
scientific article; zbMATH DE number 3560243 (Why is no real title available?)
scientific article; zbMATH DE number 3307153 (Why is no real title available?)
scientific article; zbMATH DE number 3378720 (Why is no real title available?)
Lectures on mathematical theory of extremum problems. Translated from the Russian by D. Louvish
Nonlinear Programming in Banach Space
On the cones of tangents with applications to mathematical programming
The Fritz John necessary optimality conditions in the presence of equality and inequality constraints

Cited in

(74)

\(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
Optimality conditions in nondifferentiable programming and their applications to best approximations
Homeomorphisms and generalized derivatives
Superlinear convergence of a trust region type successive linear programming method
Global invertibility of nonsmooth mappings
Hadamard's theorem for locally Lipschitzian maps
On the Caratheodory-John multiplier rule
Multiplier rules and the separation of convex sets
Refinements of necessary optimality conditions in nondifferentiable programming. I
Constraint qualifications in nonsmooth multiobjective optimization
A finite dimensional extension of Lyusternik theorem with applications to multiobjective optimization
Saddle point criteria in multiobjective fractional programming involving exponential invexity
A polynomial time algorithm for convex cost lot-sizing problems
Optimality and duality for generalized fractional programming involving nonsmooth \((F,\rho)\)-convex functions
Three types dual model for minimax fractional programming
Optimality conditions for nonconvex nonsmooth optimization via global derivatives
Second-order necessary conditions in locally Lipschitz optimization with inequality constraints
The stochastic transportation problem with single sourcing
Knapsack problems with sigmoid utilities: approximation algorithms via hybrid optimization
Necessary optimality conditions in terms of convexificators in Lipschitz optimization
KKT conditions for weak\(^\ast\) compact convex sets, theorems of the alternative, and optimality conditions
Optimality and duality for multiobjective fractional programming involving nonsmooth generalized \((\mathcal F, b, \phi, \rho, \theta)\)-univex functions
Optimality conditions and duality for nondifferentiable multiobjective fractional programming with generalized convexity
On a nonseparable convex maximization problem with continuous Knapsack constraints
( , )-invexity in nonsmooth optimization
LIPSCHITZr-INVEX FUNCTIONS AND NONSMOOTH PROGRAMMING
A derivative-free approach to constrained multiobjective nonsmooth optimization
A better insight into the generalized gradient of the absolute value of a function
The exact absolute value penalty function method for identifying strict global minima of order \(m\) in nonconvex nonsmooth programming
Generalized convexity in nondifferentiable programming
Invexity: an updated survey and new results for nonsmooth functions
Solvability results for sublinear functions and operators
Nonsmooth analysis of vector-valued mappings with contributions to nondifferentiable programming
Nonsmooth invexity
Necessary and sufficient conditions for weak efficiency in non-smooth vectorial optimization problems
Exact penalty functions and stability in locally Lipschitz programming
On optimality conditions in nonsmooth inequality constrained minimization
A geometric approach to nonsmooth optimization with sample applications
Regularity, calmness and support principle
Abstract cone approximations and generalized differentiability in nonsmooth optimization
First and second order conditions for a class of nondifferentiable optimization problems
On conditions to have bounded multipliers in locally lipschitz programming
scientific article; zbMATH DE number 3737398 (Why is no real title available?)
The boundedness of the Lagrange multipliers set and duality in mathematical programming
On sufficiency of the Kuhn-Tucker conditions in nondifferentiable programming
Protoconvex functions
Nonsmooth Invexity in Multiobjective Programming
Local second-order approximations and applications in optimization
Duality for non smooth non linear fractional multiobjective programs via (F,ρ) - convexity
An introduction to the theory of nonsmooth optimization
Generalized invexity for nonsmooth vector-valued mappings
First–order cone apporximations and necessary optimality conditions
Optimality and duality for multiobjective fractional programming involving nonsmooth(si:Fesi:ρ)–convex functions
Mixed Lagrange function in minimax fractional programming problems
A new sequential optimality condition for constrained nonsmooth optimization
Optimality and duality for multiobjective fractional programming involving nonsmooth pseudoinvex functions
Saddlepoint Problems in Nondifferentiable Programming
Univalence and degree for Lipschitz continuous maps
Nonsmooth invex functions and sufficient optimality conditions
Exactness of the absolute value penalty function method for nonsmooth ‐invex optimization problems
Approximate optimality conditions for nonsmooth optimization problems
Nonsmooth - ( , )-invexity in multiobjective programming problems
The newsvendor problem with capacitated suppliers and quantity discounts
Approximate first-order and second-order directional derivatives of a marginal function in convex optimization
Optimality and duality for nonsmooth multiobjective fractional programming problems involving exponential V-r-invexity
Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints
Clarke's tangent vectors as tangents to Lipschitz continuous curves
Local convex analysis
General constraint qualifications in nondifferentiable programming
Allocating procurement to capacitated suppliers with concave quantity discounts
Simplex-inspired algorithms for solving a class of convex programming problems
On constraint qualifications in nonlinear programming
Solving knapsack problems with \(S\)-curve return functions
Greedy approaches for a class of nonlinear generalized assignment problems

This page was built for publication: On optimality conditions in nondifferentiable programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4152352)