scientific article; zbMATH DE number 3726082
zbMATH Open0463.90059MaRDI QIDQ3914749FDOQ3914749
Authors: Ivan I. Eremin, N. N. Astaf'ev 
Publication date: 1976
Title of this publication is not available (Why is that?)
stabilitycutting planesoptimality conditionspenalty functionsparametric convex programminggeneralized dualityeconomic interpretationmethod of centres
Convex programming (90C25) Methods of successive quadratic programming type (90C55) Linear programming (90C05) Sensitivity, stability, parametric optimization (90C31) Mathematical economics (91B99) Duality theory (optimization) (49N15) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
Cited In (16)
- 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
- Academician V. S. Mikhalevich as a scientist and science organizer (on the occasion of his 70th birthday)
- The problems of non-convex quadratic programming related to phased antenna arrays optimization
- Complete characterization of optimality for convex programming in banach spaces†
- Necessary and sufficient conditions for an extremum in complex problems of optimization of systems described by polynomial and analytic functions
- Nonsmooth optimization
- Some numerical second and third order accurate methods for approximate calculation of the probability measure of a polyhedron
- FINDING NORMALIZED EQUILIBRIUM IN CONVEX-CONCAVE GAMES
- Minimizing sequences in a constrained DC optimization problem
- Dual approach to the application of barrier functions for the optimal correction of improper linear programming problems of the first kind
- Survey of input optimization1
- On the application of the residual method for the correction of inconsistent problems of convex programming
- The marginal value formula in input optimization
- The method of quasi-solutions based on barrier functions in the analysis of improper convex programs
- On the Lipschitz behavior of optimal solutions in parametric problems of quadratic optimization and linear complementarity
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3914749)
