Continuity of optimal solution functions and their conditions on objective functions
Berge maximum theoremcontinuousconvexgeneralized inverseinverse optimizationinverse problemKomiya's inverselinearoptimal solution functionquasi-convexsensitivity analysisunderdeterminedupper hemicontinuousupper semicontinuous
Inverse problems in linear algebra (15A29) Equations and inequalities involving linear operators, with vector unknowns (47A50) Linear operators and ill-posed problems, regularization (47A52) 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) Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31)
- On the solution continuity of parametric set optimization problems
- Continuity of solution set mapping for parametric generalized set-valued optimization problems
- scientific article; zbMATH DE number 3900528
- The continuity of -optimal solution set set-valued mapping in nonlinear parametric programming problem
- On continuity of optimal value map
- A Review of Quasi-Convex Functions
- An analytical approach to the problem of inverse optimization with additive objective functions: An application to human prehension
- Another inverse of the Berge maximum theorem
- Computational Methods for Inverse Problems
- Duality for nonconvex approximation and optimization.
- scientific article; zbMATH DE number 5351685 (Why is no real title available?)
- scientific article; zbMATH DE number 3752608 (Why is no real title available?)
- scientific article; zbMATH DE number 3562783 (Why is no real title available?)
- scientific article; zbMATH DE number 2145482 (Why is no real title available?)
- scientific article; zbMATH DE number 803211 (Why is no real title available?)
- scientific article; zbMATH DE number 3367052 (Why is no real title available?)
- scientific article; zbMATH DE number 3186512 (Why is no real title available?)
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Inverse of the Berge maximum theorem
- Inverse Optimization
- Lipschitz Behavior of Solutions to Convex Minimization Problems
- Nine kinds of quasiconcavity and concavity
- On an instance of the inverse shortest paths problem
- On sufficiency of the Kuhn-Tucker conditions
- Perturbed Optimization in Banach Spaces II: A Theory Based on a Strong Directional Constraint Qualification
- Point source reconstruction principle of linear inverse problems
- Postmodern analysis
- Quasi-Convex Programming
- Set-valued analysis
- Seven Kinds of Convexity
- Stability in Nonlinear Programming
- Technical Note—The Continuity of the Perturbation Function of a Convex Program
- The Direct Power of Adjacent Vertex Programming Methods
- The subdifferential of the optimal solution in parametric optimization
- Transonic Airfoils: Recent Developments in Theory, Experiment, and Design
- Image of a parametric optimization problem and continuity of the perturbation function
- Optimality conditions for lower semi-continuous functions
- Stochastic ridesharing user equilibrium in transport networks
- Inverse of Berge's maximum theorem in locally convex topological vector spaces and its applications
- Continuity of the null space basis and constrained optimization
- Berge's maximum theorem to vector-valued functions with some applications
- Cost-effective robust stabilization and bifurcation suppression
- The continuity properties of optimal value function of discrete optimization problems
- Approximate two‐loop robust nonlinear model predictive control with real‐time execution and closed‐loop guarantee
- A review of benchmark and test functions for global optimization algorithms and metaheuristics
- Inertial dynamics with vanishing Tikhonov regularization for multiobjective optimization
- Dynamic systems coupled with solutions of stochastic nonsmooth convex optimization
- Optimal transfer prices and technology in decentralized business groups
- Convergence and sample complexity of natural policy gradient primal-dual methods for constrained MDPs
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)
