Introduction to the theory of linear and convex programming.
From MaRDI portal
cutting planeseconomic interpretationgeneralized dualitymethod of centresoptimality conditionsparametric convex programmingpenalty functionsstability
Duality theory (optimization) (49N15) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Linear programming (90C05) Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Methods of successive quadratic programming type (90C55) Mathematical economics (91B99)
Cited in
(19)- Academician V. S. Mikhalevich as a scientist and science organizer (on the occasion of his 70th birthday)
- Some numerical second and third order accurate methods for approximate calculation of the probability measure of a polyhedron
- Penalty function method and regularization in the analysis of improper convex programs
- On the construction of regularizing algorithms for the correction of improper convex programming problems
- Dual approach to the application of barrier functions for the optimal correction of improper linear programming problems of the first kind
- The method of quasi-solutions based on barrier functions in the analysis of improper convex programs
- FINDING NORMALIZED EQUILIBRIUM IN CONVEX-CONCAVE GAMES
- Nonsmooth optimization
- On the Lipschitz behavior of optimal solutions in parametric problems of quadratic optimization and linear complementarity
- Survey of input optimization1
- Complete characterization of optimality for convex programming in banach spaces†
- The marginal value formula in input optimization
- On the application of the residual method for the correction of inconsistent problems of convex programming
- The problems of non-convex quadratic programming related to phased antenna arrays optimization
- Necessary and sufficient conditions for an extremum in complex problems of optimization of systems described by polynomial and analytic functions
- Minimizing sequences in a constrained DC optimization problem
- Problems and methods of the theory functional differential equations with discontinuous right hand side
- On the application of composite penalty functions obtained by ``gluing of external penalties with barrier ones in linear programming
- Dual gradient method with partial regularization for convex optimization problems
This page was built for publication: Introduction to the theory of linear and convex programming.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3914749)