Continuity of Optimal Solution Functions and their Conditions on Objective Functions

DOI10.1137/110850189zbMATH Open1327.90224OpenAlexW1775297201MaRDI QIDQ3449573FDOQ3449573

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

zbMATH Keywords

sensitivity analysisinverse problemgeneralized inverseconvexinverse optimizationlinearcontinuousupper semicontinuousquasi-convexupper hemicontinuousBerge maximum theoremunderdeterminedKomiya's inverseoptimal solution function

Mathematics Subject Classification ID

Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Inverse problems in linear algebra (15A29) Equations and inequalities involving linear operators, with vector unknowns (47A50) Set-valued and variational analysis (49J53) Optimality conditions for solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.) (49K30) Sensitivity, stability, well-posedness (49K40) Linear operators and ill-posed problems, regularization (47A52)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computational Methods for Inverse Problems
• Set-valued analysis
• On sufficiency of the Kuhn-Tucker conditions
• Inverse combinatorial optimization: a survey on problems, methods, and results
• A Review of Quasi-Convex Functions
• Nine kinds of quasiconcavity and concavity
• Lipschitz Behavior of Solutions to Convex Minimization Problems
• Inverse Optimization
• On an instance of the inverse shortest paths problem
• Postmodern analysis
• Quasi-Convex Programming
• Another inverse of the Berge maximum theorem
• The Direct Power of Adjacent Vertex Programming Methods
• Seven Kinds of Convexity
• Duality for nonconvex approximation and optimization.
• An analytical approach to the problem of inverse optimization with additive objective functions: An application to human prehension
• Stability in Nonlinear Programming
• Inverse of the Berge maximum theorem
• Transonic Airfoils: Recent Developments in Theory, Experiment, and Design
• Technical Note—The Continuity of the Perturbation Function of a Convex Program
• The subdifferential of the optimal solution in parametric optimization
• Perturbed Optimization in Banach Spaces II: A Theory Based on a Strong Directional Constraint Qualification
• Point source reconstruction principle of linear inverse problems

Cited In (8)

• Image of a parametric optimization problem and continuity of the perturbation function
• Cost-Effective Robust Stabilization and Bifurcation Suppression
• Berge's maximum theorem to vector-valued functions with some applications
• Approximate two‐loop robust nonlinear model predictive control with real‐time execution and closed‐loop guarantee
• Inverse of Berge's maximum theorem in locally convex topological vector spaces and its applications
• Stochastic ridesharing user equilibrium in transport networks
• Continuity of the null space basis and constrained optimization
• Optimality conditions for lower semi-continuous functions

This page was built for publication: Continuity of Optimal Solution Functions and their Conditions on Objective Functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3449573)