Piecewise Smoothness, Local Invertibility, and Parametric Analysis of Normal Maps
DOI10.1287/MOOR.21.2.401zbMATH Open0857.90122OpenAlexW2079340989MaRDI QIDQ4895565FDOQ4895565
Authors: Jong-Shi Pang, Daniel Ralph
Publication date: 14 October 1996
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.21.2.401
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
Nonlinear programming (90C30) Nonsmooth analysis (49J52) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cited In (61)
- On continuous selections of polynomial functions
- Estimates of the topological degree of a class of piecewise linear maps with applications
- Level sets of nonsmooth functions. I: Lipschitz and piecewise-differentiable rank theorems
- New generalized derivatives for solving variational inequalities using the nonsmooth Newton methods
- Sensitivity Analysis for Variational Inequalities
- Inverse and implicit function theorems forH-differentiable and semismooth functions
- Generalized Jacobian for functions with infinite dimensional range and domain
- On Second-Order Properties of the Moreau–Yosida Regularization for Constrained Nonsmooth Convex Programs
- Structural analysis of nonsmooth mappings, inverse functions, and metric projections
- Sensitivity analysis of composite piecewise smooth equations
- CALCULATING AN ELEMENT OF B-DIFFERENTIAL FOR A VECTOR-VALUED MAXIMUM FUNCTION*
- Generalized quasi variational inequalities and implicit wiener – hopf equations*
- Newton method of solving Karush-Kuhn-Tucker systems for a constrained Minimax Problem
- A nonsmooth Levenberg-Marquardt method for vertical complementarity problems
- On efficiently solving the subproblems of a level-set method for fused lasso problems
- On the superlinear convergence in computational elasto-plasticity
- Nonsmooth equations approach to a constrained minimax problem.
- Title not available (Why is that?)
- Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
- Generalized sensitivity analysis of nonlinear programs
- Newton's method for computing a normalized equilibrium in the generalized Nash game through fixed point formulation
- Generalized set-valued variational inclusions and resolvent equations
- Error bounds in mathematical programming
- Optimal harvesting in age-structured populations
- On sensitivity analysis of nonsmooth multidisciplinary optimization problems in engineering process line applications
- On the sensitivity of a Euclidean projection
- New constraint qualifications and optimality conditions for second order cone programs
- 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
- Newton and quasi-Newton methods for normal maps with polyhedral sets
- Smoothing approximations for some piecewise smooth functions
- Implications of the constant rank constraint qualification
- Nonsmooth optimization reformulations of player convex generalized Nash equilibrium problems
- Generalized multivalued quasi-variational inequalities. II
- Local inversion of a class of piecewise regular maps
- A globally convergent Newton method for convex \(SC^ 1\) minimization problems
- Set-valued resolvent equations and mixed variational inequalities
- Max-min Lyapunov functions for switched systems and related differential inclusions
- Multivalued variational inequalities and resolvent equations
- An approximate Newton method for non-smooth equations with finite max functions
- Nonsmooth optimization reformulations characterizing all solutions of jointly convex generalized Nash equilibrium problems
- Smooth and semismooth Newton methods for constrained approximation and estimation
- \(\mathrm{B}\)-subdifferentials of the projection onto the matrix simplex
- On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope
- On relaxed constant rank regularity condition in mathematical programming
- Moreau-Yosida regularization of Lagrangian-dual functions for a class of convex optimization problems
- On the semismoothness of projection mappings and maximum eigenvalue functions
- On the computation of an element of Clarke generalized Jacobian for a vector-valued max function
- Generalized sensitivity analysis of nonlinear programs using a sequence of quadratic programs
- Title not available (Why is that?)
- An approximate Newton method for solving non-smooth equations with infinite max functions
- Solution dependence on initial conditions in differential variational inequalities
- Computationally relevant generalized derivatives: theory, evaluation and applications
- Normal Maps Induced by Linear Transformations
- Improving the performance of a traffic system by fair rerouting of travelers
- Implicit smoothing and its application to optimization with piecewise smooth equality constraints
- Iteration functions in some nonsmooth optimization algorithms
- On bilevel programming. I: General nonlinear cases
- Non-zenoness of a class of differential quasi-variational inequalities
- On almost smooth functions and piecewise smooth functions
- Representation of the Clarke generalized Jacobian via the quasidifferential
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)