scientific article; zbMATH DE number 3846334
zbMATH Open0533.49024MaRDI QIDQ3316094FDOQ3316094
Authors: B. N. Pshenichnyĭ
Publication date: 1983
Title of this publication is not available (Why is that?)
Recommendations
rate of convergencelinearization methodexact penalty functiondual algorithmdiscrete minimax problems
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Convex programming (90C25) Methods of successive quadratic programming type (90C55) Linear programming (90C05) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Optimality conditions for minimax problems (49K35) Research exposition (monographs, survey articles) pertaining to calculus of variations and optimal control (49-02) Nonlinear algebraic or transcendental equations (65H99)
Cited In (18)
- On continuous and Lipschitz selections of multivalued mappings given by systems of inequalities
- Problems related to estimating the coefficients of exact penalty functions
- Academician V. S. Mikhalevich as a scientist and science organizer (on the occasion of his 70th birthday)
- Linear morphisms in a topos
- On the existence of continuous selections of a multivalued mapping related to the problem of minimizing a functional
- Title not available (Why is that?)
- Title not available (Why is that?)
- Continuous-time switching regression method with unknown switching points
- Title not available (Why is that?)
- On the problem of packing spheres in a cube
- The linearization method: Principal concepts and perspective directions
- Nonsmooth optimization
- Lexicographic solution of two-objective project planning problem under constrained reliability index
- A modification of the method of linearization for solving a mathematical programming problem on a simple set of ``parallelepiped type
- Mixed method for solving the general convex programming problem
- Title not available (Why is that?)
- Method of linearization without analytic evaluation of derivatives
- The linearization method
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 Q3316094)