On optimality conditions in nonsmooth inequality constrained minimization
From MaRDI portal
Publication:3751381
DOI10.1080/01630568708816246zbMath0611.90081MaRDI QIDQ3751381
Publication date: 1987
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630568708816246
inequality constrained minimization; first order necessary optimality conditions; nonsmooth program; approximate quasidifferentials; invex condition; semi-infinite Gordan type alternative theorem
90C25: Convex programming
90C30: Nonlinear programming
49M37: Numerical methods based on nonlinear programming
Related Items
On Quasidifferentiable Functions and Non-Differentiable Programming, Various types of nonsmooth invex functions, Directional Derivative Calculus and Optimality Conditions in Nonsmooth Mathematical Programming, A generalized mean-value theorem and optimality conditions in composite nonsmooth minimization, Nonsmooth invex functions and sufficient optimality conditions, Convex composite multi-objective nonsmooth programming, General constraint qualifications in nondifferentiable programming, Nonsmooth calculus, minimality, and monotonicity of convexificators, A Farkas lemma for difference sublinear systems and quasidifferentiable programming, Convex composite minimization with \(C^{1,1}\) functions, Necessary optimality conditions in terms of convexificators in Lipschitz optimization, Duality without constraint qualification in nonsmooth optimization, Exact penalty functions and Lagrange multipliers, Upper DSL approximates and nonsmooth optimization, Nonsmooth multiobjective programming, Convex Subcones of the Contingent Cone in Nonsmooth Calculus and Optimization, Approximate generalized Hessians and Taylor’s expansions for continuously Gâteaux differentiable functions
Cites Work
