Results 91 to 100 of about 174 (149)

Fast Reflected Forward-Backward algorithm: achieving fast convergence rates for convex optimization with linear cone constraints. [PDF]

J Sci Comput
Boţ RI, Nguyen DK, Zong C.
europepmc   +1 more source

CONVERGENCE ANALYSIS OF THE ITERATIVE METHODS FOR QUASI COMPLEMENTARITY PROBLEMS

, 1986
. In this paper, we consider the iterative methods for the quasi complemen-tar Lt problems of the orm u-m(u)>0, T { u))0, u-m(u), T ( u=0, where m is a point-to-point mapping and T is a continuous mapping from R n into itself.
Muhammad Aslam Noor
core  

A Conic Model Trust Region Method for Nonlinearly Constrained Optimization

, 2007
In this paper we present a trust region method based on conic models for nonlinearly constrained optimization problems. The trust region subproblem of our method is to minimize a conic function subject to the linearized constraints and the trust region ...
Wenyu Sun, Ya-xiang Yuan
core  

Second Order Dynamics Featuring Tikhonov Regularization and Time Scaling. [PDF]

J Optim Theory Appl
Csetnek ER, Karapetyants MA.
europepmc   +1 more source

A modified viscosity implicit-type proximal point algorithm for monotone inclusions and asymptotically nonexpansive mappings in Hadamard spaces. [PDF]

J Inequal Appl, 2018
Chang SS, Yao JC, Wen CF, Wang L.
europepmc   +1 more source

Solving Linear Inequalities In A Least Squares Sense

, 1994
. In 1980, Han [6] described a finitely terminating algorithm for solving a system Ax b of linear inequalities in a least squares sense. The algorithm uses a singular value decomposition of a submatrix of A on each iteration, making it impractical for ...
R. Bramley, B. Winnicka
core  

A first order method for linear programming parameterized by circuit imbalance. [PDF]

Math Program
Cole R, Hertrich C, Tao Y, Végh LA.
europepmc   +1 more source

A Newton-like Method for Nonlinear Semidefinite Inequalities

, 2007
A matrix map F (x) is said to be (matricially) convex, if u T F (x)u is a convex function for every u. In this paper, semidefinite systems of the type F (x) ¯ 0, where F (x) is matricially convex, are considered. This class of problems generalizes both
Motakuri Ramana, A. J. Goldman
core  

On stable least squares solution to the system of linear inequalities

Open Mathematics, 2007
Übi Evald
doaj   +1 more source

A fast continuous time approach for non-smooth convex optimization using Tikhonov regularization technique. [PDF]

Comput Optim Appl
Karapetyants MA.
europepmc   +1 more source