scientific article

zbMath0447.90051MaRDI QIDQ3893656

I. I. Ëremin, Vl. D. Mazurov

Publication date: 1979

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

simulationill-posed problemsnonstationary processescomplex evolutionary systemspoorly defined optimization problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Pattern recognition, speech recognition (68T10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (24)

On a general scheme of constructing iterative methods for searching for a Nash equilibrium in concave games ⋮ Block-iterative surrogate projection methods for convex feasibility problems ⋮ Some principles of coordinated decision making in distributed systems ⋮ About strongly Fejér monotone mappings and their relaxations ⋮ Combining the generalized descent method with the Fejér approximation method in one computation process ⋮ Fejér full-step iterative process for finding the solution of a system of linear inequalities ⋮ Linear inequalities in mathematical programming and pattern recognition ⋮ Minimizing sequences in a constrained DC optimization problem ⋮ Low-cost modification of Korpelevich's methods for monotone equilibrium problems ⋮ Application of the penalty method to nonstationary approximation of an optimization problem ⋮ Finite linearization method for systems of convex inequalities ⋮ Contraction mappings ⋮ A trajectory algorithm based on the gradient method. I: The search on the quasioptimal trajectories ⋮ Unnamed Item ⋮ On the convergence of combined relaxation methods for variational inequalties ⋮ Author's results on mathematical programming in retrospect ⋮ Combinatorial optimization problems related to the committee polyhedral separability of finite sets ⋮ Fejér processes in theory and practice: recent results ⋮ Computational complexity of the minimum committee problem and related problems ⋮ A combined relaxation method for decomposable variational inequalities^* ⋮ Duality for nonproper problems in linear programming ⋮ Gradient methods for nonstationary unconstrained optimization problems ⋮ Approximation to nonproper problems of convex programming ⋮ Primal-dual method for optimization problems with changing constraints

This page was built for publication: