Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivity
From MaRDI portal
Publication:3767140
DOI10.1007/BFb0121154zbMath0629.90079MaRDI QIDQ3767140
Publication date: 1987
Published in: Mathematical Programming Studies (Search for Journal in Brave)
stabilitysensitivity analysisminimizernondegeneracycritical conepolyhedral convex coneBouligand differentiability
Related Items
Variational analysis of the Ky Fan \(k\)-norm, Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints, A nonsmooth Newton method for variational inequalities. I: Theory, A nonsmooth variant of the Mangasarian-Fromovitz constraint qualification, A nonsmooth version of Newton's method, A generalized Jacobian based Newton method for semismooth block-triangular system of equations, 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, A numerical embedding method for solving the nonlinear optimization problem, Event--Selected Vector Field Discontinuities Yield Piecewise--Differentiable Flows, On bilevel programming. I: General nonlinear cases, Implicit function theorems for generalized equations, Minimization of \(SC^ 1\) functions and the Maratos effect, On superlinear convergence of quasi-Newton methods for nonsmooth equations, The lagrange-newton method for infinite-dimensional optimization problems, A strong metric subregularity analysis of nonsmooth mappings via steepest displacement rate, Sensitivity analysis for parametric control problems with control-state constraints, An algorithm to solve coupled 2D rolling contact problems, On branching numbers of normal manifolds, Approximate Newton methods for nonsmooth equations, Qualitative aspects of the local approximation of a piecewise differentiable function, Quadratic convergence of a smoothing Newton method for symmetric cone programming without strict complementarity, Robustness in stochastic programs with risk constraints, A coupled FETI-BDNM for solving 3D elastic frictional contact problem, Unnamed Item, A special newton-type optimization method, A necessary and a sufficient optimality condition for bilevel programming problems, Exponential Decay in the Sensitivity Analysis of Nonlinear Dynamic Programming, Stability of singular solutions of nonlinear equations with restricted smoothness assumptions, On sensitivity analysis of nonsmooth multidisciplinary optimization problems in engineering process line applications, A review on consistency and robustness properties of support vector machines for heavy-tailed distributions, Generalized Newton's method based on graphical derivatives, Complete characterizations of local weak sharp minima with applications to semi-infinite optimization and complementarity, On the characterizations of solutions to perturbed l1 conic optimization problem, Variational conditions and the proto-differentiation of partial subgradient mappings, Smoothing Newton algorithm for the second-order cone programming with a nonmonotone line search, 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, Equivalent conditions for Jacobian nonsingularity in linear symmetric cone programming, 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, On a Quantitative Semicontinuity Property of Variational Systems with Applications to Perturbed Quasidifferentiable Optimization, A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS*, 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, Sensitivity Analysis of Solutions to Generalized Equations, A family of variable metric proximal methods, The Lagrange-Newton method for nonlinear optimal control problems, Spectral Operators of Matrices: Semismoothness and Characterizations of the Generalized Jacobian, On a semi-smooth Newton method and its globalization, Implicit multifunction theorems for the sensitivity analysis of variational conditions, Globally and superlinearly convergent inexact Newton-Krylov algorithms for solving nonsmooth equations, On an algorithm solving two-level programming problems with nonunique lower level solutions, Image space analysis and separation forG-semidifferentiable vector problems, Computation of generalized differentials in nonlinear complementarity problems, Solution differentiability and continuation of Newton's method for variational inequality problems over polyhedral sets, On concepts of directional differentiability, Generalized Newton Algorithms for Tilt-Stable Minimizers in Nonsmooth Optimization, Globally convergent BFGS method for nonsmooth convex optimization, Constrained Best Euclidean Distance Embedding on a Sphere: A Matrix Optimization Approach, Approximations of nondifferentiable functions and local topological equivalence., Robustness of stochastic programs with endogenous randomness via contamination, Solution differentiability for variational inequalities, Sensitivity analysis for constraint and variational systems by means of set-valued differentiation, Mathematical foundations of nonsmooth embedding methods, Local analysis of Newton-type methods for variational inequalities and nonlinear programming, Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications, Local stability of solutions to differentiable optimization problems in Banach spaces, Bilevel optimization for calibrating point spread functions in blind deconvolution, Second Order Sufficiency Criteria for a Discrete Optimal Control Problem
