Results 91 to 100 of about 651 (102)
Linear decomposition approach for a class of nonconvex programming problems. [PDF]
Shen P, Wang C.
europepmc +1 more source
A new filter QP-free method for the nonlinear inequality constrained optimization problem. [PDF]
Shang Y, Jin ZF, Pu D.
europepmc +1 more source
Solving a class of generalized fractional programming problems using the feasibility of linear programs. [PDF]
Shen P, Zhang T, Wang C.
europepmc +1 more source
Abstract generalized vector quasi-equilibrium problems in noncompact Hadamard manifolds. [PDF]
Lu H, Wang Z.
europepmc +1 more source
On the directional asymptotic approach in optimization theory. [PDF]
Benko M, Mehlitz P.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
SOR-Like Iteration Methods for Second-Order Cone Linear Complementarity Problems
East Asian Journal on Applied Mathematics, 2020SOR-like modulus-based matrix splitting iteration methods for second-order cone linear complementarity problems using Jordan algebras are developed. The convergence of the methods is established and a strategy for the choice of the method parameters is ...
Zhizhi Li
semanticscholar +1 more source
Advances in Applied Mathematics and Mechanics, 2020
In this paper, we propose an efficient numerical method for the optimal control problem constrained by elliptic equations. Being approximated by the finite element method (FEM), the continuous optimal control problem is discretized into a finite ...
Jinda Yang
semanticscholar +1 more source
In this paper, we propose an efficient numerical method for the optimal control problem constrained by elliptic equations. Being approximated by the finite element method (FEM), the continuous optimal control problem is discretized into a finite ...
Jinda Yang
semanticscholar +1 more source
Numerical Mathematics: Theory, Methods and Applications, 2019
Modulus-based matrix splitting iteration methods were recently proposed for solving implicit complementarity problems. In this paper, to solve a class of implicit complementarity problems, two-step modulus-based matrix splitting iteration methods are ...
Yan Wang
semanticscholar +1 more source
Modulus-based matrix splitting iteration methods were recently proposed for solving implicit complementarity problems. In this paper, to solve a class of implicit complementarity problems, two-step modulus-based matrix splitting iteration methods are ...
Yan Wang
semanticscholar +1 more source
Modulus-Based Multisplitting Iteration Methods for a Class of Nonlinear Complementarity Problems
East Asian Journal on Applied Mathematics, 2018Modulus-based multisplitting iterative methods for large sparse nonlinear complementarity problems are developed. The approach is based on a reformulation of nonlinear complimentarily problems as implicit fixed-point equations and includes Jacobi, Gauss ...
Hongru Xu
semanticscholar +1 more source