Results 211 to 220 of about 12,379 (256)

A sufficient condition for self-concordance with application to some classes of structured convex programming problems.

Jarre, F., Roos, C., Hertog, D. den, Terlaky, T.   +3 more
core  

A Quantum Interior-Point Method for Second-Order Cone Programming

, 2019
Kerenidis, Iordanis, Prakash, Anupam, Szilagyi, Daniel   +2 more
openaire   +1 more source

Some of the next articles are maybe not open access.

Related searches:

An Interior‐Point Trust‐Region Algorithm for General Symmetric Cone Programming

SIAM Journal on Optimization, 2007
An interior-point trust-region algorithm is proposed for minimizing a general (non-convex) quadratic objective function in the intersection of a symmetric cone and an affine subspace. The algorithm uses a trust-region model to ensure descent on a suitable merit function. Global first-order and second-order convergence results are proved.
Ye Lu, Ya-Xiang Yuan
exaly   +2 more sources

A non-interior continuation method for second-order cone programming

Optimization, 2009
We extend the smoothing function proposed by Huang, Han and Chen [Journal of Optimization Theory and Applications, 117 (2003), pp. 39–68] for the non-linear complementarity problems to the second-order cone programming (SOCP). Based on this smoothing function, a non-interior continuation method is presented for solving the SOCP.
Xiaoni Chi, Sanyang Liu
exaly   +2 more sources

A circular cone relaxation primal interior point algorithm for LP

Optimization, 2003
We consider a primal interior point algorithm for LP. The method uses a search direction obtained by minimizing the original objective over a linearly transformed section of the circular cone circumscribed around the nonnegative orthant. If the latter problem has a finite solution, it provides a lower bound for the optimal objective and a target point ...
exaly   +2 more sources

A new corrector–predictor interior-point method for symmetric cone optimization

Periodica Mathematica Hungarica, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
B. Kheirfam, N. Hosseinpour, H. Abedi
openaire   +1 more source

Cones with semi-interior points and equilibrium

Journal of Mathematical Economics, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
BASILE, ACHILLE, GRAZIANO, MARIA GABRIELLA, Papadaki, Maria, Polyrakis, Ioannis A.   +3 more
openaire   +2 more sources

Interior Point Methods for Second-Order Cone Programming and OR Applications

Computational Optimization and Applications, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yu-Ju Kuo, Hans D. Mittelmann
openaire   +2 more sources

Extension of primal-dual interior point algorithms to symmetric cones

Mathematical Programming, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
S. H. Schmieta, Farid Alizadeh
openaire   +2 more sources

Convex Cones and Generalized Interiors

2011
The notion of a convex cone, which lies between that of a linear subspace and that of a convex set, is the main topic of this chapter. It has been very fruitful in many branches of nonlinear analysis. For instance, closed convex cones provide decompositions analogous to the well-known orthogonal decomposition based on closed linear subspaces. They also
Heinz H. Bauschke, Patrick L. Combettes
openaire   +1 more source