Publication:819950: Difference between revisions
From MaRDI portal
Publication:819950
Created automatically from import240129110113 |
(No difference)
|
Latest revision as of 13:34, 30 January 2024
DOI10.1007/BF02579049zbMATH Open1099.49016MaRDI QIDQ819950FDOQ819950
Publication date: 4 April 2006
Published in: Top (Search for Journal in Brave)
Optimality conditions and duality in mathematical programming (90C46) Nonlinear programming (90C30) Nonsmooth analysis (49J52) Set-valued and variational analysis (49J53)
Cites Work
- Quasidifferentiable functions and pairs of convex compact sets
- New Lagrange multipliers rules for constrained quasidifferentiable optimization
- A Calculus of EPI-Derivatives Applicable to Optimization
- Mean Value Inequalities in Hilbert Space
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Variational Analysis
- Introductory lectures on convex optimization. A basic course.
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Convex Analysis
- Nondifferentiable optimization by smooth approximations
- Subdifferential calculus using \(\varepsilon\)-subdifferentials
- Foundations of bilevel programming
- Optimality conditions in differentiable vector optimization via second-order tangent sets
- Techniques of variational analysis
- Inf-convolution, sous-additivite, convexite des fonctions numériques
- Lagrange Multipliers and Optimality
- Optimization and nonsmooth analysis
- Semismooth and Semiconvex Functions in Constrained Optimization
- Variational Analysis and Generalized Differentiation I
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Nonsmooth sequential analysis in Asplund spaces
- Set-valued analysis
- Convex functions, monotone operators and differentiability.
- Maximum principle in the problem of time optimal response with nonsmooth constraints
- Generalized differential calculus for nonsmooth and set-valued mappings
- Coderivatives in parametric optimization
- A mathematical view of interior-point methods in convex optimization
- Nonsmooth Analysis: Differential Calculus of Nondifferentiable Mappings
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- Optimal control
- A generalized derivative for calm and stable functions
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- Hunting for a smaller convex subdifferential
- Probability essentials.
- Convexifactors, generalized convexity and vector optimization
- Optimality conditions for maximizing a locally Lipschitz function
- Approximating Subdifferentials by Random Sampling of Gradients
- Convexifactors, generalized convexity, and optimality conditions
- Convex analysis and nonlinear optimization. Theory and examples
- Generalized Gradients and Applications
- An Algorithm for Constrained Optimization with Semismooth Functions
- Nondifferentiable Multiplier Rules for Optimization and Bilevel Optimization Problems
- A Generalized Second-Order Derivative in Nonsmooth Optimization
- Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- A simple characterization of solutions sets of convex programs
- Multiplier rules under mixed assumptions of differentiability and Lipschitz continuity
- Equilibrium problems with equilibrium constraints via multiobjective optimization
- Pseudonormality and a Lagrange multiplier theory for constrained optimization
- Demyanov difference of two sets and optimality conditions of Lagrange multiplier type for constrained quasidifferential optimization.
- Multivalued analysis and nonlinear programming problems with perturbations
- Approximate Subdifferentials and Applications. I: The Finite Dimensional Theory
- A constraint qualification in quasidifferentiable programming
- Quasi-Multiplier Rules for Quasidifferentiable Extremum Problems
- On Optimality Conditions in Quasidifferentiable Optimization
- Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
- Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
- Characterization of solution sets of convex programs
- On second-order subdifferentials and their applications
- Nonsmooth Equations: Motivation and Algorithms
- Generalized Convexity, Generalized Monotonicity and Nonsmooth Analysis
- An appropriate subdifferential for quasiconvex functions
- On various notions of regularity of sets in nonsmooth analysis
- The rise of nonsmooth analysis: its main tools
- Amenable functions in optimization
- A survey of subdifferential calculus with applications
- Approximation and decomposition properties of some classes of locally d.c. functions
- Approximate subdifferentials and applications 3: the metric theory
- Difference of compact sets in the sense of demyanov and its application to non-smooth analysis
- Optimality conditions for \(C^{1,1}\) constrained multiobjective problems
- Approximate subdifferentials and applications II
- Proximal analysis and minimization principles
- Proximal Subgradients, Marginal Values, and Augmented Lagrangians in Nonconvex Optimization
- Ample parameterization of variational inclusions
- Directional derivative estimates for the optimal value function of a quasidifferentiable programming problem
- Mean Value Inequalities
- Generalized K-T conditions and penalty functions for quasidifferentiable programming
Cited In (7)
- Optimal synchronization of non-smooth fractional order chaotic systems with uncertainty based on extension of a numerical approach in fractional optimal control problems
- Approximate optimality conditions for minimax programming problems
- On the numerical solution of nonlinear eigenvalue problems for the Monge-Ampère operator
- Generalized Hukuhara-Clarke derivative of interval-valued functions and its properties
- Smoothing approach for a class of nonsmooth optimal control problems
- The augmented Lagrangian method for a type of inverse quadratic programming problems over second-order cones
- On the Karush-Kuhn-Tucker reformulation of the bilevel optimization problem
This page was built for publication: Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q819950)