Results 91 to 100 of about 2,842 (122)
Some of the next articles are maybe not open access.
Optimization Letters, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nayak, Rupaj Kumar, Desai, Jitamitra
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nayak, Rupaj Kumar, Desai, Jitamitra
openaire +2 more sources
SIAM Journal on Optimization, 1999
Summary: This paper proposes a globally convergent predictor-corrector infeasible-interior-point algorithm for the monotone semidefinite linear complementarity problem using the Alizadeh-Haeberly-Overton search direction, and shows its quadratic local convergence under the strict complementarity condition.
Masakazu KOJIMA +2 more
openaire +1 more source
Summary: This paper proposes a globally convergent predictor-corrector infeasible-interior-point algorithm for the monotone semidefinite linear complementarity problem using the Alizadeh-Haeberly-Overton search direction, and shows its quadratic local convergence under the strict complementarity condition.
Masakazu KOJIMA +2 more
openaire +1 more source
On the Analyticity of Underlying HKM Paths for Monotone Semidefinite Linear Complementarity Problems
Journal of Optimization Theory and Applications, 2009The author considers properties of the so-called off-central paths for approaching solutions of the semi-definite linear complementarity problem within the interior point approach. These paths are determined by using suitable ordinary differential equations.
openaire +2 more sources
Mathematics of Operations Research, 2002
In a recent paper on semidefinite linear complementarity problems, Gowda and Song (2000) introduced and studied the P-property, P2-property, GUS-property, and strong monotonicity property for linear transformation L: Sn → Sn, where Sn is the space of all symmetric and real n × n matrices.
Parthasarathy, T. +2 more
openaire +2 more sources
In a recent paper on semidefinite linear complementarity problems, Gowda and Song (2000) introduced and studied the P-property, P2-property, GUS-property, and strong monotonicity property for linear transformation L: Sn → Sn, where Sn is the space of all symmetric and real n × n matrices.
Parthasarathy, T. +2 more
openaire +2 more sources
Journal of Optimization Theory and Applications, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sim, C. K., Zhao, G.
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sim, C. K., Zhao, G.
openaire +3 more sources
SIAM Journal on Optimization, 2005
Summary: This note points out an error in the local quadratic convergence proof of the predictor-corrector interior-point algorithm for solving the semidefinite linear complementarity problem based on the Alizadeh-Haeberly-Overton search direction presented in [\textit{M. Kojima, M. Shida} and \textit{S. Shindoh}, SIAM J. Optim.
Lu, Zhaosong, Monteiro, Renato D. C.
openaire +1 more source
Summary: This note points out an error in the local quadratic convergence proof of the predictor-corrector interior-point algorithm for solving the semidefinite linear complementarity problem based on the Alizadeh-Haeberly-Overton search direction presented in [\textit{M. Kojima, M. Shida} and \textit{S. Shindoh}, SIAM J. Optim.
Lu, Zhaosong, Monteiro, Renato D. C.
openaire +1 more source
Acta Mathematica Scientia, 2007
Abstract A noninterior continuation method is proposed for semidefinite complementarity problem (SDCP). This method improves the noninterior continuation methods recently developed for SDCP by Chen and Tseng. The main properties of our method are: (i) it is well defined for the monotones SDCP; (ii) it has to solve just one linear system of equations ...
openaire +1 more source
Abstract A noninterior continuation method is proposed for semidefinite complementarity problem (SDCP). This method improves the noninterior continuation methods recently developed for SDCP by Chen and Tseng. The main properties of our method are: (i) it is well defined for the monotones SDCP; (ii) it has to solve just one linear system of equations ...
openaire +1 more source
SIAM Journal on Optimization, 2011
An interior point method (IPM) defines a search direction at each interior point of a region. These search directions form a direction field which in turn gives rise to a system of ordinary differential equations (ODEs). The solutions of the system of ODEs can be viewed as underlying paths in the interior of the region. In [C.-K. Sim and G. Zhao, Math.
openaire +2 more sources
An interior point method (IPM) defines a search direction at each interior point of a region. These search directions form a direction field which in turn gives rise to a system of ordinary differential equations (ODEs). The solutions of the system of ODEs can be viewed as underlying paths in the interior of the region. In [C.-K. Sim and G. Zhao, Math.
openaire +2 more sources
Errata: On semidefinite linear complementarity problems
Mathematical Programming, 2001M. Seetharama Gowda, Yoon Song
openaire +1 more source
ON STEIN TRANSFORMATION IN SEMIDEFINITE LINEAR COMPLEMENTARITY PROBLEMS
Journal of applied mathematics & informatics, 2014Yoon J. Song, Seon Ho Shin
openaire +1 more source