Quantitative Analysis for Perturbed Abstract Inequality Systems in Banach Spaces
From MaRDI portal
Publication:4687244
DOI10.1137/17M1151274zbMath1401.90264OpenAlexW2894721158WikidataQ129150319 ScholiaQ129150319MaRDI QIDQ4687244
Publication date: 11 October 2018
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/17m1151274
Sensitivity, stability, well-posedness (49K40) Nonconvex programming, global optimization (90C26) Sensitivity, stability, parametric optimization (90C31) Programming in abstract spaces (90C48)
Related Items (3)
On semilocal convergence analysis for two-step Newton method under generalized Lipschitz conditions in Banach spaces ⋮ Lipschitz-like property for linear constraint systems ⋮ Error bounds for approximate solutions of abstract inequality systems and infinite systems of inequalities on Banach spaces
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extended Newton methods for conic inequalities: approximate solutions and the extended Smale \(\alpha\)-theory
- Calmness modulus of fully perturbed linear programs
- Convergence analysis of the Gauss-Newton method for convex inclusion and convex-composite optimization problems
- Calmness of the feasible set mapping for linear inequality systems
- Inequality systems and optimization
- Optimization methods and stability of inclusions in Banach spaces
- Notions of relative interior in Banach spaces
- Set containment characterization
- Global error bounds for piecewise convex polynomials
- Calmness of the argmin mapping in linear semi-infinite optimization
- Aubin property and uniqueness of solutions in cone constrained optimization
- Regularity modulus of arbitrarily perturbed linear inequality systems
- Extension of Newton's method to nonlinear functions with values in a cone
- Metric regularity of semi-infinite constraint systems
- Calmness of constraint systems with applications
- Approximate Solutions of Analytic Inequality Systems
- Coderivatives and the Solution Map of a Linear Constraint System
- On Convergence Rates of Linearized Proximal Algorithms for Convex Composite Optimization with Applications
- On Lipschitzian Properties of Implicit Multifunctions
- Approximate Solutions for Abstract Inequality Systems
- Second-Order Variational Analysis in Conic Programming with Applications to Optimality and Stability
- On the Asymptotically Well Behaved Functions and Global Error Bound for Convex Polynomials
- Lipschitz Behavior of Solutions to Convex Minimization Problems
- Majorizing Functions and Convergence of the Gauss–Newton Method for Convex Composite Optimization
- Metric Regularity in Convex Semi-Infinite Optimization under Canonical Perturbations
- Variational Analysis in Semi-Infinite and Infinite Programming, I: Stability of Linear Inequality Systems of Feasible Solutions
- On Stable Feasible Sets in Generalized Semi-infinite Programming
- Lipschitzian properties of multifunctions
- Sensitivity Analysis of Parametrized Programs under Cone Constraints
- Stability Theory for Systems of Inequalities. Part I: Linear Systems
- Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
- Nondegeneracy and Quantitative Stability of Parameterized Optimization Problems with Multiple Solutions
- On the Boundedness and Stability of Solutions to the Affine Variational Inequality Problem
- Variational Analysis
- On Generic One-Parametric Semi-Infinite Optimization
- Metric regularity and subdifferential calculus
- Stability and Well-Posedness in Linear Semi-Infinite Programming
- Stability Theory for Linear Inequality Systems
- Characterizations of Strong Regularity for Variational Inequalities over Polyhedral Convex Sets
- A unified approach to generalized inverses of linear operators: I. Algebraic, topological and projectional properties
- Approximations to Solutions to Systems of Linear Inequalities
- Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
- Stability of Linear-Quadratic Minimization over Euclidean Balls
- Calmness Modulus of Linear Semi-infinite Programs
- Newton's Method for Underdetermined Systems of Equations Under the γ-Condition
- Knowledge-Based Linear Programming
- Strong Lipschitz Stability of Stationary Solutions for Nonlinear Programs and Variational Inequalities
- Monotone processes of convex and concave type
- Convex Analysis
- Normed Convex Processes
This page was built for publication: Quantitative Analysis for Perturbed Abstract Inequality Systems in Banach Spaces
