نتایج جستجو برای: interior point method

تعداد نتایج: 2080526  

Journal: :International Journal of Control 2009

Journal: :Optimization Methods and Software 2005

We present an improved version of a full Nesterov-Todd step infeasible interior-point method for linear complementarityproblem over symmetric cone (Bull. Iranian Math. Soc., 40(3), 541-564, (2014)). In the earlier version, each iteration consisted of one so-called feasibility step and a few -at most three - centering steps. Here, each iteration consists of only a feasibility step. Thus, the new...

In this paper, we deal to obtain some new complexity results for solving semidefinite optimization (SDO) problem by interior-point methods (IPMs). We define a new proximity function for the SDO by a new kernel function. Furthermore we formulate an algorithm for a primal dual interior-point method (IPM) for the SDO by using the proximity function and give its complexity analysis, and then we sho...

Journal: :Comp. Opt. and Appl. 2009
Fernanda M. P. Raupp Benar Fux Svaiter

The two-case pattern recognition problem aims to find the best way of linearly separate two different classes of data points with a good generalization performance. In the context of learning machines proposed to solve the pattern recognition problem, the analytic center machine (ACM) uses the analytic center cutting plane method restricted to spherical shells. In this work we prove existence a...

2001
Brien Alkire Lieven Vandenberghe

ABSTRACT We describe efficient interior-point methods for the design of filters with constraints on the magnitude spectrum, for example, piecewise-constant upper and lower bounds, and arbitrary phase. Several researchers have observed that problems of this type can be solved via convex optimization and spectral factorization. The associated optimization problems are usually solved via linear pr...

2013
Samir Bouali Samir Kabbaj

In this paper, we propose a new infeasible interior-point algorithm with full NesterovTodd (NT) steps for semidefinite programming (SDP). The main iteration consists of a feasibility step and several centrality steps. We used a specific kernel function to induce the feasibility step. The analysis is more simplified. The iteration bound coincides with the currently best known bound for infeasibl...

Journal: :ACM Transactions on Quantum Computing 2020

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید