Continuity of Optimal Solution Functions and their Conditions on Objective Functions
DOI10.1137/110850189zbMath1327.90224OpenAlexW1775297201MaRDI QIDQ3449573
Yasushi Terazono, Ayumu Matani
Publication date: 4 November 2015
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/110850189
inverse problemsensitivity analysislineargeneralized inverseunderdeterminedconvexcontinuousinverse optimizationupper semicontinuousquasi-convexupper hemicontinuousBerge maximum theoremKomiya's inverseoptimal solution function
Convex programming (90C25) Sensitivity, stability, well-posedness (49K40) Sensitivity, stability, parametric optimization (90C31) Set-valued and variational analysis (49J53) Inverse problems in linear algebra (15A29) Equations and inequalities involving linear operators, with vector unknowns (47A50) Linear operators and ill-posed problems, regularization (47A52) Optimality conditions for solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.) (49K30)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An analytical approach to the problem of inverse optimization with additive objective functions: An application to human prehension
- Postmodern analysis
- On sufficiency of the Kuhn-Tucker conditions
- Nine kinds of quasiconcavity and concavity
- On an instance of the inverse shortest paths problem
- Inverse of the Berge maximum theorem
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Duality for nonconvex approximation and optimization.
- Point source reconstruction principle of linear inverse problems
- Lipschitz Behavior of Solutions to Convex Minimization Problems
- Inverse Optimization
- Transonic Airfoils: Recent Developments in Theory, Experiment, and Design
- Computational Methods for Inverse Problems
- Perturbed Optimization in Banach Spaces II: A Theory Based on a Strong Directional Constraint Qualification
- The Direct Power of Adjacent Vertex Programming Methods
- Seven Kinds of Convexity
- Quasi-Convex Programming
- A Review of Quasi-Convex Functions
- Stability in Nonlinear Programming
- Technical Note—The Continuity of the Perturbation Function of a Convex Program
- Set-valued analysis