Optimization of the optimal value function in problems of convex parametric programming
From MaRDI portal
Publication:6194911
DOI10.1134/s0081543823060111MaRDI QIDQ6194911
Publication date: 16 February 2024
Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lipschitz and Hölder stability of optimization problems and generalized equations
- Convexity and concavity properties of the optimal value function in parametric nonlinear programming
- Numerical solution methods for multiextremal problems connected with inverse problems in mathematical programming
- Some questions of piecewise linear programming
- Minimax models in the theory of numerical methods. Transl. from the 1989 Russian orig. by Olga Chuyan
- Nonsmooth equations in optimization. Regularity, calculus, methods and applications
- Piyavskij's method for solving the general global optimization problem
- On the reduction of nonconvex problems of generalized semi-infinite mathematical programming to convex problems of semi-infinite programming
- Deterministic global optimization. Theory, methods and applications
- An objective penalty function method for biconvex programming
- Biconvex sets and optimization with biconvex functions: a survey and extensions
- Lipschitz Behavior of Solutions to Convex Minimization Problems
- Generalized convexity and concavity of the optimal value function in nonlinear programming
- A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
- Stable parametric programming
- Cutting methods in E n+ 1 for global optimization of a class of functions
This page was built for publication: Optimization of the optimal value function in problems of convex parametric programming
