Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Fréchet subdifferential calculus and optimality conditions in nondifferentiable programming - MaRDI portal

Fréchet subdifferential calculus and optimality conditions in nondifferentiable programming

From MaRDI portal
Publication:3426240

DOI10.1080/02331930600816395zbMath1121.49017OpenAlexW2057578212MaRDI QIDQ3426240

Nguyen Mau Nam, Boris S. Mordukhovich, Nguyen Dong Yen

Publication date: 8 March 2007

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://digitalcommons.wayne.edu/math_reports/29




Related Items (75)

Calculus rules of generalized \(\epsilon\)-subdifferential for vector valued mappings and applicationsGeneralized penalization and maximization of vectorial nonsmooth functionsOptimality and duality in nonsmooth composite vector optimization and applicationsOptimality conditions for robust nonsmooth multiobjective optimization problems in asplund spacesSubgradients of the value function in a parametric convex optimal control problemSome results concerning chain rules for Dini-Hadamard constructionsWeak sharp efficiency in multiobjective optimizationOptimality conditions of quasi $(\alpha,\varepsilon)$-solutions and approximate mixed type duality for DC composite optimization problemsRelative Pareto minimizers for multiobjective problems: Existence and optimality conditionsApproximate solutions in nonsmooth and nonconvex cone constrained vector optimizationCalculus of tangent sets and derivatives of set-valued maps under metric subregularity conditionsZeroth-Order Regularized Optimization (ZORO): Approximately Sparse Gradients and Adaptive SamplingOn the problem of minimizing a difference of polyhedral convex functions under linear constraintsEnhanced Karush-Kuhn-Tucker condition and weaker constraint qualificationsNECESSARY OPTIMALITY CONDITIONS FOR SUPER MINIMIZERS IN STRUCTURAL PROBLEMS OF MULTIOBJECTIVE OPTIMIZATIONOn the rotational invariant \(L_1\)-norm PCASecond-order subdifferentials and convexity of real-valued functionsA proximal algorithm with backtracked extrapolation for a class of structured fractional programmingStrong Fermat rules for constrained set-valued optimization problems on Banach spacesNew Bregman proximal type algoritms for solving DC optimization problemsFréchet subdifferential calculus for interval-valued functions and its applications in nonsmooth interval optimizationVariational analysis of marginal functions with applications to bilevel programmingInertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization ProblemsFuzzy multiplier, sum and intersection rules in non-Lipschitzian settings: decoupling approach revisitedRobust optimality and duality for composite uncertain multiobjective optimization in Asplund spaces with its applicationsApproximate solutions for robust multiobjective optimization programming in Asplund spacesA note on an approximate mean value theorem for Fréchet subgradientsConvergence analysis of a proximal point algorithm for minimizing differences of functionsUnnamed ItemComplete characterizations of local weak sharp minima with applications to semi-infinite optimization and complementarityIsolated and proper efficiencies in semi-infinite vector optimization problemsOptimality conditions for weak and firm efficiency in set-valued optimizationA new penalization tool in scalar and vector optimizationsSecond-order characterizations of quasiconvexity and pseudoconvexity for differentiable functions with Lipschitzian derivativesTwo-level value function approach to non-smooth optimistic and pessimistic bilevel programsOptimality conditions and duality in nonsmooth multiobjective optimization problemsNew Applications of Variational Analysis to Optimization and ControlApproximate versions of proximal iteratively reweighted algorithms including an extended IP-ICMM for signal and image processing problemsSecond-order optimality conditions for efficiency in \(C^{1,1}\)-smooth quasiconvex multiobjective programming problemAlternating direction method of multipliers for a class of nonconvex bilinear optimization: convergence analysis and applicationsSubgradients of marginal functions in parametric mathematical programmingNonsmooth semi-infinite multiobjective optimization problemsRemarks on strict efficiency in scalar and vector optimizationOn the Dini-Hadamard subdifferential of the difference of two functionsNew necessary optimality conditions in optimistic bilevel programmingOptimality conditions for mixed discrete bilevel optimization problemsSubgradients of the value function to a parametric optimal control problemStrong duality and optimality conditions for generalized equilibrium problemsNecessary conditions for super minimizers in constrained multiobjective optimizationOn the robust PCA and Weiszfeld's algorithmNonconvex weak sharp minima on Riemannian manifoldsOptimality and duality in nonsmooth conic vector optimizationOn the Dini-Hadamard-like coderivative of the difference of two single-valued mappingsNecessary optimality conditions for weak sharp minima in set-valued optimizationSufficient conditions for error bounds of difference functions and applicationsSubgradients of value functions in parametric dynamic programmingSecond-order characterizations of \(\mathcal{C}^1\)-smooth robustly quasiconvex functionsBilevel programming problems with simple convex lower levelOptimality conditions and total dualities for conic programming involving composite functionMordukhovich subgradients of the value function to a parametric discrete optimal control problemOptimality conditions for minimizing the difference of nonconvex vector-valued mappingsCoderivative necessary optimality conditions for sharp and robust efficiencies in vector optimization with variable ordering structureOn Algorithms for Difference of Monotone OperatorsOn Algorithms for Difference of Monotone OperatorsDifferential stability of discrete optimal control problems with mixed contraintsA hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problemsMin-sup-type zero duality gap properties for DC composite optimization problemStrict directional solutions in vectorial problems: necessary optimality conditionsOptimality conditions and duality for DC programming in locally convex spacesOptimality results for a specific fractional problemSensitivity analysis in parametric multiobjective discrete-time control via Fréchet subdifferential calculus of the frontier mapSubgradients of the Value Function via Multiplier Sets of Parametric Convex Discrete Optimal Control ProblemsBilevel Optimization and Variational AnalysisExtrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional ProgramsCalmness and calculus: two basic patterns



Cites Work


This page was built for publication: Fréchet subdifferential calculus and optimality conditions in nondifferentiable programming