Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivity
From MaRDI portal
Publication:3767140
Recommendations
- scientific article; zbMATH DE number 3911150
- Optimality conditions for nonsmooth vector problems in normed spaces
- scientific article; zbMATH DE number 3853846
- Necessary and sufficient conditions in constrained optimization
- Isolated minimizers and proper efficiency for \(C^{0,1}\) constrained vector optimization problems
- A note on nondifferentiable symmetric duality
- scientific article; zbMATH DE number 1286827
- scientific article; zbMATH DE number 4158384
- A characterization of strict local minimizers of order one for nonsmooth static minmax problems
- scientific article; zbMATH DE number 2001276
Cited in
(86)- On a semi-smooth Newton method and its globalization
- On statistical sensitivity analysis in stochastic programming
- Second-order conditions and constraint qualifications in stability and sensitivity analysis of solutions to optimization problems in Hilbert spaces
- Sensitivity analysis for nonsmooth generalized equations
- Path following and critical points for contact problems
- Solution behavior for parametric implicit complementarity problems
- Local convergence of quasi-Newton methods for B-differentiable equations
- The Lagrange-Newton method for nonlinear optimal control problems
- Local analysis of Newton-type methods for variational inequalities and nonlinear programming
- Local stability of solutions to differentiable optimization problems in Banach spaces
- A nonsmooth Newton method for variational inequalities. I: Theory
- A nonsmooth variant of the Mangasarian-Fromovitz constraint qualification
- On superlinear convergence of quasi-Newton methods for nonsmooth equations
- Approximate Newton methods for nonsmooth equations
- Globally convergent BFGS method for nonsmooth convex optimization
- A family of variable metric proximal methods
- Implicit multifunction theorems for the sensitivity analysis of variational conditions
- On an algorithm solving two-level programming problems with nonunique lower level solutions
- Solution differentiability and continuation of Newton's method for variational inequality problems over polyhedral sets
- On concepts of directional differentiability
- Approximations of nondifferentiable functions and local topological equivalence.
- Strong convexity in stochastic programs with complete recourse
- A globally convergent Newton method for convex \(SC^ 1\) minimization problems
- On \(G\)-semidifferentiable functions in Euclidean spaces
- On bilevel programming. I: General nonlinear cases
- Implicit function theorems for generalized equations
- Minimization of \(SC^ 1\) functions and the Maratos effect
- Sensitivity analysis for parametric control problems with control-state constraints
- Quadratic convergence of a smoothing Newton method for symmetric cone programming without strict complementarity
- Robustness in stochastic programs with risk constraints
- Robustness of stochastic programs with endogenous randomness via contamination
- Sensitivity analysis for variational inequalities and nonlinear complementarity problems
- Stability and sensitivity-analysis for stochastic programming
- Newton's method for the nonlinear complementarity problem: a B- differentiable equation approach
- Variational analysis of the Ky Fan k-norm
- Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
- A nonsmooth version of Newton's method
- A generalized Jacobian based Newton method for semismooth block-triangular system of equations
- A review on consistency and robustness properties of support vector machines for heavy-tailed distributions
- Bilevel optimization for calibrating point spread functions in blind deconvolution
- Stability of singular solutions of nonlinear equations with restricted smoothness assumptions
- An algorithm to solve coupled 2D rolling contact problems
- A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS*
- Globally and superlinearly convergent inexact Newton-Krylov algorithms for solving nonsmooth equations
- Second Order Sufficiency Criteria for a Discrete Optimal Control Problem
- Event-selected vector field discontinuities yield piecewise-differentiable flows
- scientific article; zbMATH DE number 4213739 (Why is no real title available?)
- A strong metric subregularity analysis of nonsmooth mappings via steepest displacement rate
- The lagrange-newton method for infinite-dimensional optimization problems
- Local structure of feasible sets in nonlinear programming, part II: Nondegeneracy
- A Note on Differentiability of Global Optimal Values
- On branching numbers of normal manifolds
- Sensitivity Analysis of Solutions to Generalized Equations
- A special newton-type optimization method
- A necessary and a sufficient optimality condition for bilevel programming problems
- On sensitivity analysis of nonsmooth multidisciplinary optimization problems in engineering process line applications
- Sensitivity analysis for constraint and variational systems by means of set-valued differentiation
- Smoothing Newton algorithm for the second-order cone programming with a nonmonotone line search
- A numerical embedding method for solving the nonlinear optimization problem
- Qualitative aspects of the local approximation of a piecewise differentiable function
- Variational conditions and the proto-differentiation of partial subgradient mappings
- Image space analysis and separation forG-semidifferentiable vector problems
- Generalized Newton algorithms for tilt-stable minimizers in nonsmooth optimization
- Exponential decay in the sensitivity analysis of nonlinear dynamic programming
- Spectral operators of matrices: semismoothness and characterizations of the generalized Jacobian
- Constrained best Euclidean distance embedding on a sphere: a matrix optimization approach
- Equivalent conditions for Jacobian nonsingularity in linear symmetric cone programming
- On the characterizations of solutions to perturbed l₁ conic optimization problem
- On a Quantitative Semicontinuity Property of Variational Systems with Applications to Perturbed Quasidifferentiable Optimization
- A coupled FETI-BDNM for solving 3D elastic frictional contact problem
- A coupled SBFETI-BDEs method for solving 2D static and dynamic contact problem with friction
- Generalized Newton's method based on graphical derivatives
- Complete characterizations of local weak sharp minima with applications to semi-infinite optimization and complementarity
- Risk quantization by magnitude and propensity
- A FETI B-differentiable equation method for elastic frictional contact problem with nonconforming mesh
- Polyhedral Newton-min algorithms for complementarity problems
- The optimality conditions and stability analysis for the second-order cone double constrained variational inequalities
- Three implementations of B-differentiable Newton method in solving 3D elastoplastic frictional contact problems and their discussion
- Projected gradient descent accumulates at Bouligand stationary points
- On the B-differential of the componentwise minimum of two affine vector functions
- Fast computation of superquantile-constrained optimization through implicit scenario reduction
- A globalized inexact semismooth Newton method for strongly convex optimal control problems
- Computation of generalized differentials in nonlinear complementarity problems
- Solution differentiability for variational inequalities
- Mathematical foundations of nonsmooth embedding methods
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
This page was built for publication: Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3767140)