Results 221 to 230 of about 10,718 (252)
Some of the next articles are maybe not open access.
QUASI-INTERIOR POINTS OF CONES
1963Abstract : A point is not equal to theta belonging to a convex cone K with vertex theta in a locally convex linear topological space X is called a quasi interior point (QI-point) of K if the linear extension of the set K intersection (x-K) is dense in X. The set K sub q of all quasi-interior points of K is called the quasi-interior of K.
C. C. Braunschweiger, R. E. Fullerton
openaire +1 more source
Extension of primal-dual interior point algorithms to symmetric cones
Mathematical Programming, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
S. H. Schmieta, Farid Alizadeh
openaire +2 more sources
A New Non-interior Continuation Method for Second-Order Cone Programming
2009 International Joint Conference on Computational Sciences and Optimization, 2009A new smoothing function of the well known Fischer-Burmeister function is given. Based on this new function, a non-interior continuation algorithm is proposed for solving second-order cone programming. At each iteration, the proposed algorithm solves only one system of linear equations and performs only one line search. This algorithm can start from an
Liang Fang +3 more
openaire +2 more sources
An Infeasible Interior-Point Algorithm for Stochastic Second-Order Cone Optimization
Journal of Optimization Theory and Applications, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Baha Alzalg +2 more
openaire +1 more source
On programming when the positive cone has an empty interior
Journal of Optimization Theory and Applications, 1990We present a condition which is equivalent to the existence of the Lagrange multiplier for the general convex programming problem. This condition enables one to study a hypothesis distinct from the one of nonempty interior of the positive cone of the space of restrictions, that is commonly used. Simple examples of this condition are given.
De Araujo, A. P., Monteiro, P. K.
openaire +1 more source
An inexact non-interior continuation method for symmetric cone complementarity problems
2012 9th International Conference on Fuzzy Systems and Knowledge Discovery, 2012An inexact non-interior continuation method is presented for solving the symmetric cone complementarity problems (SCCP). Based on a one-parametric class of smoothing functions, the proposed algorithm reformulates the SCCP as a nonlinear system of equations.
Xiaoni Chi, Suobin Zhang
openaire +1 more source
Two wide neighborhood interior-point methods for symmetric cone optimization
Computational Optimization and Applications, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
M. Sayadi Shahraki +2 more
openaire +1 more source
Anchoring Points and Cones of Opportunities in Interior Multiobjective Linear Programming
Journal of the Operational Research Society, 1994Summary: This paper presents a modification of one variant of Karmarkar's interior-point linear programming algorithm to Multiobjective Linear Programming (MOLP) problems. We show that by taking the variant known as the affine-scaling primal algorithm, generating locally-relevant scaling coefficients and applying them to the projected gradients ...
openaire +1 more source
Cones with semi-interior points
PositivityzbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Multi-Standard Quadratic Optimization: interior point methods and cone programming reformulation
Computational Optimization and Applications, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Immanuel M. Bomze, Werner Schachinger
openaire +2 more sources