Implicit Functions and Solution Mappings
From MaRDI portal
Publication:3535792
DOI10.1007/978-0-387-87821-8zbMATH Open1178.26001OpenAlexW4231183558MaRDI QIDQ3535792FDOQ3535792
Authors: A. L. Dontchev, R. T. Rockafellar 
Publication date: 14 November 2008
Published in: Springer Monographs in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-0-387-87821-8
Recommendations
variational inequalitiesgeneralized equationsiterative processesconvergence of setsdifferentiable and semidifferentiable functionsinverse and implicit functions (mappings)Lyusternik and Graves theoremsmultivalued functions and mappingsselections of multivalued mappings
Sensitivity, stability, parametric optimization (90C31) Implicit function theorems, Jacobians, transformations with several variables (26B10) Set-valued and variational analysis (49J53) Sensitivity, stability, well-posedness (49K40) Time-scale analysis and singular perturbations in control/observation systems (93C70) Abstract inverse mapping and implicit function theorems involving nonlinear operators (47J07) Research exposition (monographs, survey articles) pertaining to real functions (26-02) Implicit function theorems; global Newton methods on manifolds (58C15)
Cited In (only showing first 100 items - show all)
- Several Classes of Stationary Points for Rank Regularized Minimization Problems
- Lipschitz-like property for linear constraint systems
- Existence of Lagrange Multipliers under Gâteaux Differentiable Data with Applications to Stochastic Optimal Control Problems
- A general iterative procedure to solve generalized equations with differentiable multifunction
- Necessary and sufficient conditions for emptiness of the cones of generalized support vectors
- Existence and boundedness of second-order Karush-Kuhn-Tucker multipliers for set-valued optimization with variable ordering structures
- An iterative method for solving relaxed one-sided Lipschitz algebraic inclusions
- Approximations and generalized Newton methods
- Newton's method for solving generalized equations without Lipschitz condition
- Convergence Rate of Inexact Proximal Point Algorithms for Operator with Hölder Metric Subregularity
- Directional Quasi-/Pseudo-Normality as Sufficient Conditions for Metric Subregularity
- On ill-posedness concepts, stable solvability and saturation
- A linearly convergent majorized ADMM with indefinite proximal terms for convex composite programming and its applications
- Regularity of Newton's iteration for general parametric variational system
- Double fused Lasso regularized regression with both matrix and vector valued predictors
- Title not available (Why is that?)
- Metric subregularity in generalized equations
- Equivalent Lipschitz surrogates for zero-norm and rank optimization problems
- Projection-based local and global Lipschitz moduli of the optimal value in linear programming
- A proximal DC approach for quadratic assignment problem
- The Gauss-Seidel method for generalized Nash equilibrium problems of polynomials
- Characterizations for strong Abadie constraint qualification and applications to calmness
- On Derivative Criteria for Metric Regularity
- Indirect inference with a non-smooth criterion function
- Convergence within binary market scoring rules
- Lipschitz modulus of the optimal value in linear programming
- Time-distributed optimization for real-time model predictive control: stability, robustness, and constraint satisfaction
- Necessary conditions for linear convergence of iterated expansive, set-valued mappings
- On generalized solvability of variable nonlinear integral equations on cones
- Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry
- New analysis of linear convergence of gradient-type methods via unifying error bound conditions
- Level-set subdifferential error bounds and linear convergence of Bregman proximal gradient method
- Metric inequality conditions on sets and consequences in optimization
- Optical Flow
- Directional Pareto efficiency: concepts and optimality conditions
- A note on stability of stationary points in mathematical programs with generalized complementarity constraints
- Perturbation techniques for convergence analysis of proximal gradient method and other first-order algorithms via variational analysis
- Partial Error Bound Conditions and the Linear Convergence Rate of the Alternating Direction Method of Multipliers
- Moduli of regularity and rates of convergence for Fejér monotone sequences
- Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria
- Solvability of the power flow problem in DC overhead wire circuit modeling.
- Partial Smoothness and Constant Rank
- New inverse and implicit function theorems for differentiable maps with isolated critical points
- Calmness of linear constraint systems under structured perturbations with an application to the path-following scheme
- The Condition Number of Riemannian Approximation Problems
- A New Type of Directional Regularity for Mappings and Applications to Optimization
- Stability and sensitivity of uncertain linear programs
- Hölderian Error Bounds and Kurdyka-Łojasiewicz Inequality for the Trust Region Subproblem
- Nonlinear Forward-Backward Splitting with Projection Correction
- Convergence properties of a restricted Newton-type method for generalized equations with metrically regular mappings
- Augmented Lagrangians and hidden convexity in sufficient conditions for local optimality
- A concept of inner prederivative for set-valued mappings and its applications
- From Calmness to Hoffman Constants for Linear Semi-infinite Inequality Systems
- A survey on some recent developments of alternating direction method of multipliers
- The developments of proximal point algorithms
- Title not available (Why is that?)
- Optimal price-threshold control for battery operation with aging phenomenon: a quasiconvex optimization approach
- A semismooth Newton-based augmented Lagrangian algorithm for density matrix least squares problems
- A continuous dynamical splitting method for solving ‘strongly+weakly’ convex programming problems
- Title not available (Why is that?)
- Implicit functions and parametrizations in dimension three: generalized solutions
- When are minimizing controls also minimizing relaxed controls?
- Gradient boosting for convex cone predict and optimize problems
- FBstab: a proximally stabilized semismooth algorithm for convex quadratic programming
- Numerical computation of the optimal vector field: exemplified by a fishery model
- An inverse mapping theorem for \(H\)-differentiable set-valued maps
- Higher-order optimality conditions for set-valued optimization with ordering cones having empty interior using variational sets
- Newton's method for solving generalized equations: Kantorovich's and Smale's approaches
- Smoothing method in multi-criteria transportation network equilibrium problem
- Model predictive control, the economy, and the issue of global warming
- Variational sets of perturbation maps and applications to sensitivity analysis for constrained vector optimization
- Restricted normal cones and sparsity optimization with affine constraints
- Strongly regular nonsmooth generalized equations
- On higher-order sensitivity analysis in nonsmooth vector optimization
- Quantitative stability of a generalized equation
- Error bounds and metric subregularity
- Perturbation of solutions of the coincidence point problem for two mappings
- Calmness of the Optimal Value in Linear Programming
- Local monotonicity and full stability for parametric variational systems
- An implicit-function theorem for \(C^{0,1}\)-equations and parametric \(C^{1,1}\)-optimization
- Metric subregularity of composition set-valued mappings with applications to fixed point theory
- Normally admissible stratifications and calculation of normal cones to a finite union of polyhedral sets
- Equilibrium in multi-criteria transportation networks
- On regular coderivatives in parametric equilibria with non-unique multipliers
- A first-order inexact primal-dual algorithm for a class of convex-concave saddle point problems
- On stability of M-stationary points in mpccs
- Implicit function theorems for generalized equations
- Coderivatives of implicit multifunctions and stability of variational systems
- Outer limit of subdifferentials and calmness moduli in linear and nonlinear programming
- Hölder metric regularity of set-valued maps
- Convergence of inexact Newton methods for generalized equations
- Variational inequalities over Euclidean balls
- Nonlinear perturbations of polyhedral normal cone mappings and affine variational inequalities
- Convex analysis and financial equilibrium
- Critical objective size and calmness modulus in linear programming
- Convergence rates with inexact non-expansive operators
- A note on Lipschitzian stability of variational inequalities over perturbed polyhedral convex sets
- Some remarks on stability of generalized equations
- Calmness of the feasible set mapping for linear inequality systems
- On relaxing the Mangasarian-Fromovitz constraint qualification
This page was built for publication: Implicit Functions and Solution Mappings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3535792)
