Piecewise Smoothness, Local Invertibility, and Parametric Analysis of Normal Maps
From MaRDI portal
Recommendations
- Structural analysis of nonsmooth mappings, inverse functions, and metric projections
- Implications of the constant rank constraint qualification
- Branching numbers for Euclidean projections onto convex polyhedra
- On the semismoothness of projection mappings and maximum eigenvalue functions
- On the sensitivity of a Euclidean projection
Cited in
(61)- On efficiently solving the subproblems of a level-set method for fused lasso problems
- On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope
- Set-valued resolvent equations and mixed variational inequalities
- On a smooth dual gap function for a class of player convex generalized Nash equilibrium problems
- A smoothing Levenberg-Marquardt method for nonlinear complementarity problems
- Generalized sensitivity analysis of nonlinear programs
- On almost smooth functions and piecewise smooth functions
- Sensitivity analysis of composite piecewise smooth equations
- Newton's method for computing a normalized equilibrium in the generalized Nash game through fixed point formulation
- Generalized Jacobian for functions with infinite dimensional range and domain
- A nonsmooth Levenberg-Marquardt method for vertical complementarity problems
- Newton and quasi-Newton methods for normal maps with polyhedral sets
- Local inversion of a class of piecewise regular maps
- Implicit smoothing and its application to optimization with piecewise smooth equality constraints
- Generalized set-valued variational inclusions and resolvent equations
- On the computation of an element of Clarke generalized Jacobian for a vector-valued max function
- On relaxed constant rank regularity condition in mathematical programming
- On the superlinear convergence in computational elasto-plasticity
- Nonsmooth equations approach to a constrained minimax problem.
- Normal Maps Induced by Linear Transformations
- Iteration functions in some nonsmooth optimization algorithms
- Smooth and semismooth Newton methods for constrained approximation and estimation
- Nonsmooth optimization reformulations characterizing all solutions of jointly convex generalized Nash equilibrium problems
- An approximate Newton method for non-smooth equations with finite max functions
- Error bounds in mathematical programming
- \(\mathrm{B}\)-subdifferentials of the projection onto the matrix simplex
- An approximate Newton method for solving non-smooth equations with infinite max functions
- On the sensitivity of a Euclidean projection
- Improving the performance of a traffic system by fair rerouting of travelers
- Smoothing approximations for some piecewise smooth functions
- CALCULATING AN ELEMENT OF B-DIFFERENTIAL FOR A VECTOR-VALUED MAXIMUM FUNCTION*
- Nonsmooth optimization reformulations of player convex generalized Nash equilibrium problems
- On sensitivity analysis of nonsmooth multidisciplinary optimization problems in engineering process line applications
- On bilevel programming. I: General nonlinear cases
- Max-min Lyapunov functions for switched systems and related differential inclusions
- scientific article; zbMATH DE number 6147934 (Why is no real title available?)
- Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
- Moreau-Yosida regularization of Lagrangian-dual functions for a class of convex optimization problems
- Sensitivity Analysis for Variational Inequalities
- Implications of the constant rank constraint qualification
- Generalized sensitivity analysis of nonlinear programs using a sequence of quadratic programs
- Generalized multivalued quasi-variational inequalities. II
- Newton method of solving Karush-Kuhn-Tucker systems for a constrained Minimax Problem
- New constraint qualifications and optimality conditions for second order cone programs
- Representation of the Clarke generalized Jacobian via the quasidifferential
- On Second-Order Properties of the Moreau–Yosida Regularization for Constrained Nonsmooth Convex Programs
- Multivalued variational inequalities and resolvent equations
- On the semismoothness of projection mappings and maximum eigenvalue functions
- Inverse and implicit function theorems forH-differentiable and semismooth functions
- scientific article; zbMATH DE number 124651 (Why is no real title available?)
- Solution dependence on initial conditions in differential variational inequalities
- Non-zenoness of a class of differential quasi-variational inequalities
- Computationally relevant generalized derivatives: theory, evaluation and applications
- A globally convergent Newton method for convex \(SC^ 1\) minimization problems
- Optimal harvesting in age-structured populations
- Structural analysis of nonsmooth mappings, inverse functions, and metric projections
- Generalized quasi variational inequalities and implicit wiener – hopf equations*
- New generalized derivatives for solving variational inequalities using the nonsmooth Newton methods
- Level sets of nonsmooth functions. I: Lipschitz and piecewise-differentiable rank theorems
- Estimates of the topological degree of a class of piecewise linear maps with applications
- On continuous selections of polynomial functions
This page was built for publication: Piecewise Smoothness, Local Invertibility, and Parametric Analysis of Normal Maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4895565)
