Search

Start Over Subject interior-point methods

1. New complexity analysis of a full Nesterov-Todd step infeasible interior-point algorithm for symmetric optimization

Creator:
Kheirfam, Behrouz and Mahdavi-Amiri, Nezam
Format:
bez média and svazek
Type:
model:article and TEXT
Subject:
interior-point methods, symmetric cone optimization, Euclidean Jordan algebra, and polynomial complexity
Language:
English
Description:
A full Nesterov-Todd step infeasible interior-point algorithm is proposed for solving linear programming problems over symmetric cones by using the Euclidean Jordan algebra. Using a new approach, we also provide a search direction and show that the iteration bound coincides with the best known bound for infeasible interior-point methods.
Rights:
http://creativecommons.org/publicdomain/mark/1.0/ and policy:public

2. Primal interior point method for minimization of generalized minimax functions

Creator:
Lukšan, Ladislav, Matonoha, Ctirad, and Vlček, Jan
Format:
bez média and svazek
Type:
model:article and TEXT
Subject:
unconstrained optimization, large-scale optimization, nonsmooth optimization, generalized minimax optimization, interior-point methods, modified Newton methods, variable metric methods, global convergence, and computational experiments
Language:
English
Description:
In this paper, we propose a primal interior-point method for large sparse generalized minimax optimization. After a short introduction, where the problem is stated, we introduce the basic equations of the Newton method applied to the KKT conditions and propose a primal interior-point method. Next we describe the basic algorithm and give more details concerning its implementation covering numerical differentiation, variable metric updates, and a barrier parameter decrease. Using standard weak assumptions, we prove that this algorithm is globally convergent if a bounded barrier is used. Then, using stronger assumptions, we prove that it is globally convergent also for the logarithmic barrier. Finally, we present results of computational experiments confirming the efficiency of the primal interior point method for special cases of generalized minimax problems.
Rights:
http://creativecommons.org/publicdomain/mark/1.0/ and policy:public

3. Primal interior-point method for large sparse minimax optimization

Creator:
Lukšan, Ladislav, Matonoha, Ctirad, and Vlček, Jan
Format:
bez média and svazek
Type:
model:article and TEXT
Subject:
unconstrained optimization, large-scale optimization, minimax optimization, nonsmooth optimization, interior-point methods, modified Newton methods, variable metric methods, and computational experiments
Language:
English
Description:
In this paper, we propose a primal interior-point method for large sparse minimax optimization. After a short introduction, the complete algorithm is introduced and important implementation details are given. We prove that this algorithm is globally convergent under standard mild assumptions. Thus the large sparse nonconvex minimax optimization problems can be solved successfully. The results of extensive computational experiments given in this paper confirm efficiency and robustness of the proposed method.
Rights:
http://creativecommons.org/publicdomain/mark/1.0/ and policy:public