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)
- Lipschitz-like property for linear constraint systems
- 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
- A new type of directional regularity for mappings and applications to optimization
- 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
- 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
- Nonlinear forward-backward splitting with projection correction
- Metric subregularity in generalized equations
- Partial error bound conditions and the linear convergence rate of the alternating direction method of multipliers
- A uniform approach to Hölder calmness of subdifferentials
- Equivalent Lipschitz surrogates for zero-norm and rank optimization problems
- Optical flow
- Existence of Lagrange multipliers under Gâteaux differentiable data with applications to stochastic optimal control 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
- 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
- Directional quasi-/pseudo-normality as sufficient conditions for metric subregularity
- Level-set subdifferential error bounds and linear convergence of Bregman proximal gradient method
- Metric inequality conditions on sets and consequences in optimization
- 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
- Quasi-Newton methods for solving nonsmooth equations: generalized Dennis-Moré theorem and Broyden's update
- Moduli of regularity and rates of convergence for Fejér monotone sequences
- Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria
- On derivative criteria for metric regularity
- Solvability of the power flow problem in DC overhead wire circuit modeling.
- Several classes of stationary points for rank regularized minimization problems
- 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
- Stability and sensitivity of uncertain linear programs
- Hölderian Error Bounds and Kurdyka-Łojasiewicz Inequality for the Trust Region Subproblem
- 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
- Partial smoothness and constant rank
- A survey on some recent developments of alternating direction method of multipliers
- The developments of proximal point algorithms
- 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
- Lipschitz modulus of linear and convex inequality systems with the Hausdorff metric
- Karush-Kuhn-Tucker multiplier rules for efficient solutions of set-valued equilibrium problem with constraints
- Calculus for directional limiting normal cones and subdifferentials
- Proximal point algorithms on Hadamard manifolds: linear convergence and finite termination
- Point-based neighborhoods for sharp calmness constants in linear programming
- A note on implicit multifunction theorems
- Quantitative characterizations of regularity properties of collections of sets
- Relation between the constant rank and the relaxed constant rank constraint qualifications
- On regularity conditions for complementarity problems
- On the solution existence and stability of quadratically constrained nonconvex quadratic programs
- Crystallization to the square lattice for a two-body potential
- Extended Newton-type method for nonlinear functions with values in a cone
- Stability properties of the Tikhonov regularization for nonmonotone inclusions
- Stability and sensitivity analysis of solutions to weak vector variational inequalities
- Sensitivity analysis of boundary equilibria
- Enhanced metric regularity and Lipschitzian properties of variational systems
- Error bounds, quadratic growth, and linear convergence of proximal methods
- On necessary optimality conditions for nonsmooth vector optimization problems with mixed constraints in infinite dimensions
- Asymmetric forward-backward-adjoint splitting for solving monotone inclusions involving three operators
- First and second-order optimality conditions for nonsmooth vector optimization using set-valued directional derivatives
- Second-order conditions for open-cone minimizers and firm minimizers in set-valued optimization subject to mixed constraints
- Over relaxed hybrid proximal extragradient algorithm and its application to several operator splitting methods
- Metric regularity of the sum of multifunctions and applications
- Universal Nash equilibrium strategies for differential games
- Second-order optimality conditions with the envelope-like effect for set-valued optimization
- Generic minimizing behavior in semialgebraic optimization
- Bifurcation without Fréchet differentiability at the trivial solution
- Implications of the constant rank constraint qualification
- Set regularities and feasibility problems
- On metric regularity and the boundary of the feasible set in linear optimization
- Optimality, identifiability, and sensitivity
- Regularity and robustness in monotone Bayesian games
- Generalizations of paradoxical results in multidimensional item response theory
- Evolutionary algorithm for bilevel optimization using approximations of the lower level optimal solution mapping
- Existence and boundedness of solutions in infinite-dimensional vector optimization problems
- Local linear convergence of the ADMM/Douglas-Rachford algorithms without strong convexity and application to statistical imaging
- Newton's method for generalized equations: a sequential implicit function theorem
- A Lyusternik-Graves theorem for the proximal point method
- Openness results for parametric set-valued mappings in Asplund spaces
- A unified approach to error bounds for structured convex optimization problems
- A robust semi-local convergence analysis of Newton's method for cone inclusion problems in Banach spaces under affine invariant majorant condition
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)
