Nonsmooth calculus, minimality, and monotonicity of convexificators
From MaRDI portal
Publication:1301893
DOI10.1023/A:1021790120780zbMath0956.90033OpenAlexW90642534MaRDI QIDQ1301893
Dinh The Luc, Vaithilingam Jeyakumar
Publication date: 12 September 1999
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1021790120780
nonsmooth analysisquasi-convexityquasimonotonicityextremalityupper convex approximationslower concave approximationsmean-value conditionsminimal convexificators
Related Items (88)
An open mapping theorem using unbounded generalized Jacobians ⋮ Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder) ⋮ Optimality conditions and duality for interval-valued optimization problems using convexifactors ⋮ On variational inequalities using directional convexificators ⋮ Optimality conditions for pessimistic bilevel problems using convexificator ⋮ On constraint qualifications and sensitivity analysis for general optimization problems via pseudo-Jacobians ⋮ Necessary optimality conditions in terms of convexificators in Lipschitz optimization ⋮ Stronger Kuhn-Tucker type conditions in nonsmooth multiobjective optimization: Locally Lipschitz case ⋮ Convexificators and boundedness of the Kuhn–Tucker multipliers set ⋮ Optimality condition for local efficient solutions of vector equilibrium problems via convexificators and applications ⋮ Duality for nonsmooth optimization problems with equilibrium constraints, using convexificators ⋮ Optimality conditions for maximizing a locally Lipschitz function ⋮ Continuous generalized convex functions and their characterizations ⋮ On semi-infinite mathematical programming problems with equilibrium constraints using generalized convexity ⋮ A study on vector variational-like inequalities using convexificators and application to its bi-level form ⋮ The subdifferentiability properties of typical functions in \(C[0,1\)] ⋮ Optimality conditions in optimization problems with convex feasible set using convexificators ⋮ Sufficient optimality conditions using convexifactors for optimistic bilevel programming problem ⋮ Duality for multiobjective fractional programming problem using convexifactors ⋮ Duality results for interval-valued semiinfinite optimization problems with equilibrium constraints using convexificators ⋮ Optimality conditions for mathematical programs with equilibrium constraints using directional convexificators ⋮ Sufficient Optimality Conditions for a Robust Multiobjective Problem ⋮ Applying convexificators in robust multiobjective optimization ⋮ Applying directional upper semi-regular convexificators in bilevel optimization ⋮ Duality for fractional interval-valued optimization problem via convexificator ⋮ Optimality Conditions Using Convexifactors for a Multiobjective Fractional Bilevel Programming Problem ⋮ On constraint qualifications in terms of approximate Jacobians for nonsmooth continuous optimization problems ⋮ Metric regularity of quasidifferentiable mappings and optimality conditions for nonsmooth mathematical programming problems ⋮ Optimality conditions for optimistic bilevel programming problem using convexifactors ⋮ Semistrictly and neatly quasiconvex programming using lower global subdifferentials ⋮ Constraint qualifications in terms of convexificators for nonsmooth programming problems with mixed constraints ⋮ Regularity properties of constrained set-valued mappings ⋮ Optimality conditions for MPECs in terms of directional upper convexifactors ⋮ On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm ⋮ Necessary and sufficient optimality conditions for fractional multi-objective problems ⋮ Sufficient optimality conditions and Mond-Weir duality results for a fractional multiobjective optimization problem ⋮ Local uniqueness of solutions of general variational inequalities ⋮ Optimality and duality results for bilevel programming problem using convexifactors ⋮ Optimality conditions in terms of convexificators for a bilevel multiobjective optimization problem ⋮ On Optimality Conditions for Henig Efficiency and Superefficiency in Vector Equilibrium Problems ⋮ Necessary optimality conditions for bilevel set optimization problems ⋮ Sensitivity analysis of the value function for nonsmooth optimization problems ⋮ Optimality and duality in constrained interval-valued optimization ⋮ Optimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificators ⋮ ϵ-Efficient solutions in semi-infinite multiobjective optimization ⋮ Optimality conditions for a bilevel optimization problem in terms of KKT multipliers and convexificators ⋮ Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators ⋮ Multiobjective Problems: Enhanced Necessary Conditions and New Constraint Qualifications through Convexificators ⋮ Efficiency conditions for multiobjective bilevel programming problems via convexificators ⋮ Optimality conditions and duality in terms of convexificators for multiobjective bilevel programming problem with equilibrium constraints ⋮ Generalized nonsmooth cone convexity in terms of convexifactors in vector optimization ⋮ Necessary optimality conditions for a bilevel multiobjective programming problem via a Ψ-reformulation ⋮ Normal coderivative for multifunctions and implicit function theorems ⋮ Optimality conditions for a multiobjective bilevel optimization problem involving set valued constraints ⋮ Convexificators and necessary conditions for efficiency ⋮ Necessary and sufficient conditions for efficiency via convexificators ⋮ Convexifactors, generalized convexity and vector optimization ⋮ Convexificators and strong Kuhn-Tucker conditions ⋮ Convexifactors, generalized convexity, and optimality conditions ⋮ Unnamed Item ⋮ Necessary optimality conditions for bilevel optimization problems using convexificators ⋮ Existence and boundedness of the Kuhn-Tucker multipliers in nonsmooth multiobjective optimization ⋮ Subdifferential calculus for a quasiconvex function with generator ⋮ Optimality conditions for nonsmooth mathematical programs with equilibrium constraints, using convexificators ⋮ Fuzzy and Exact Optimality Conditions for a Bilevel Set-Valued Problem via Extremal Principles ⋮ Solution point characterizations and convergence analysis of a descent algorithm for nonsmooth continuous complementarity problems. ⋮ Characterization of nonsmooth quasiconvex functions and their Greenberg-Pierskalla's subdifferentials using semi-quasidifferentiability notion ⋮ Necessary and sufficient optimality conditions using convexifactors for mathematical programs with equilibrium constraints ⋮ On the Applications of Nonsmooth Vector Optimization Problems to Solve Generalized Vector Variational Inequalities Using Convexificators ⋮ Optimality and Duality for Non-Lipschitz Multiobjective Optimization Problems ⋮ On global subdifferentials with applications in nonsmooth optimization ⋮ Sufficient optimality conditions and duality results for a bilevel multiobjective optimization problem via a Ψ reformulation ⋮ On nonsmooth mathematical programs with equilibrium constraints using generalized convexity ⋮ Optimality conditions for \(\epsilon \)-quasi solutions of optimization problems via \(\epsilon \)-upper convexificators with applications ⋮ Optimality conditions of a set valued optimization problem with the help of directional convexificators ⋮ Nonsmooth multiobjective programming and constraint qualifications ⋮ Semi-quasidifferentiability in nonsmooth nonconvex multiobjective optimization ⋮ A new Abadie-type constraint qualification for general optimization problems ⋮ Necessary efficiency conditions for vector equilibrium problems with general inequality constraints via convexificators ⋮ Optimality conditions for multiobjective fractional programming, via convexificators ⋮ Necessary optimality conditions of a D.C. set-valued bilevel optimization problem ⋮ Duality for a class of nonsmooth multiobjective programming problems using convexificators ⋮ Necessary optimality conditions for optimistic bilevel programming problems using set-valued programming ⋮ Approximate optimality for quasi approximate solutions in nonsmooth semi-infinite programming problems, using ε-upper semi-regular semi-convexificators ⋮ Generalized convex functions and generalized differentials ⋮ Optimality and duality for nonsmooth minimax programming problems using convexifactor ⋮ The Fréchet approximate Jacobian and local uniqueness in variational inequalities ⋮ Optimality conditions for nonsmooth semidefinite programming via convexificators
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A generalized derivative for calm and stable functions
- Hunting for a smaller convex subdifferential
- Integration of subdifferentials of lower semicontinuous functions on Banach spaces
- Nonsmooth Equations: Motivation and Algorithms
- Optimization and nonsmooth analysis
- Approximate subdifferentials and applications II
- On optimality conditions in nonsmooth inequality constrained minimization
- On the mean value theorem
- Generalized Directional Derivatives and Subgradients of Nonconvex Functions
- Composite Nonsmooth Programming with Gâteaux Differentiability
- Approximate Jacobian Matrices for Nonsmooth Continuous Maps and C1-Optimization
- Approximate generalized Hessians and Taylor’s expansions for continuously Gâteaux differentiable functions
- Characterisations of quasiconvex functions
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Small convex-valued subdifferentials in mathematical programming
- The Linear Nonconvex Generalized Gradient and Lagrange Multipliers
- Mean Value Property and Subdifferential Criteria for Lower Semicontinuous Functions
This page was built for publication: Nonsmooth calculus, minimality, and monotonicity of convexificators
