Convexifactors, generalized convexity, and optimality conditions

Authors:
J. Dutta;S. Chandra
Affiliations:
Postdoctoral Fellow, Indian Statistical Institute, New Delhi, India;Professor, Department of Mathematics, Indian Institute of Technology, New Delhi, India
Venue:
Journal of Optimization Theory and Applications
Year:
2002

Citing 5
Cited 0

Generalized monotonicity of subdifferentials and generalized convexity

Journal of Optimization Theory and Applications
Subdifferential properties of quasiconvex and pseudoconvex functions: unified approach

Journal of Optimization Theory and Applications
Nonsmooth calculus, minimality, and monotonicity of convexificators

Journal of Optimization Theory and Applications
Iterative solution of nonlinear equations in several variables

Iterative solution of nonlinear equations in several variables
A Sharp Lagrange Multiplier Rule for Nonsmooth Mathematical Programming Problems Involving Equality Constraints

SIAM Journal on Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

The recently introduced notion of a convexifactor is further studied, and quasiconvex and pseudoconvex functions are characterized in terms of convexifactors. As an application to a chain rule, a necessary optimality condition is deduced for an inequality constrained mathematical programming problem.