scientific article; zbMATH DE number 3908176
For a system of convex inequalities \(\phi_ i(x)\leq 0\) \((i=1,...,m)\), which satisfies Slater's condition (\(\exists z: \phi_ i(z)<0\), \(\forall i)\), the method is proposed: \[ x^{(k+1)}=x^{(k)}- 2(\sum^{m}_{i=1}\nu_{ik}\phi_ i(x^{(k)})/\| \sum^{m}_{i=1}\nu_{ik}g_ i(x^{(k)})\|^ 2)\sum^{m}_{i=1}\nu_{ik}g_ i(x^{(k)}), \] where \(\{\nu_{ik}\}^ m_{i=1}\) must satisfy two requirements for every k: (1) if \(\phi_ i(x^{(k)})>0\), then \(\nu_{ik}\geq 0\), else \(\nu_{ik}=0\); (2) \(\sum^{m}_{i=1}\nu_{ik}>0.\) Theorem 1. If \(\{\phi_ i\}^ m_{i=1}\) are defined on the real Hilbert space H, \(g_ i(x)\) is the continued Frechet's derivative of \(\phi_ i\) in x, and \(x^{(0)}\) is some point from H, then the method gives some solution of the system in a finite number of steps. Theorem 2. If \(\{\phi_ i\}^ m_{i=1}\) are defined on the Euclidean real space \(R^ n\), \(g_ i(x)\) is some subgradient of \(\phi_ i\) in x and \(x^{(0)}\) is some point from \(R^ n\), then the method gives some solution of the system in a finite number of steps. Remark. Later the authors found out that the requirement on \(\{\nu_{ik}\}^ m_{i=1}\) may be replaced by: (1) if \(\phi_ i(x^{(k)})\geq 0\), then \(\nu_{ik}\geq 0\), else \(\nu_{ik}=0\); (2) \(\sum^{m}_{i=1}\nu_{ik}>0\).
- scientific article; zbMATH DE number 3945896
- Finite linearization method for systems of convex inequalities
- Fejer methods for solving infinite systems of convex inequalities
- scientific article; zbMATH DE number 4180680
- Methods of solving systems of convex programming problems
- scientific article; zbMATH DE number 4012324
- A constrained optimization approach to solving certain systems of convex equations
- Methods for solving systems of linear and convex inequalities based on the Fejér principle
- A new finitely convergent algorithm for systems of nonlinear inequalities
- A finitely terminating algorithm for systems of nonlinear inequalities
- A finite method to find a point in a set defined by a convex differentiable functional
- Finite iteration method for evaluation of interior point of algebraic polyhedron and bound for step number
- Random search method for solving series of linear programming problems
- Algorithm of dividing ellipsoids: a method of solution of systems of nonconvex inequalities
- scientific article; zbMATH DE number 3942358 (Why is no real title available?)
- scientific article; zbMATH DE number 3945896 (Why is no real title available?)
- Finite linearization method for systems of convex inequalities
- scientific article; zbMATH DE number 4104797 (Why is no real title available?)
- scientific article; zbMATH DE number 617966 (Why is no real title available?)
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 Q3686508)