Results 221 to 230 of about 12,379 (256)

QUASI-INTERIOR POINTS OF CONES

1963
Abstract : 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

An Infeasible Interior-Point Algorithm for Stochastic Second-Order Cone Optimization

Journal of Optimization Theory and Applications, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Baha Alzalg, Khaled Badarneh, Ayat Ababneh   +2 more
openaire   +1 more source

On programming when the positive cone has an empty interior

Journal of Optimization Theory and Applications, 1990
We 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, 2012
An 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

Interior Reconstruction from Truncated Projection Data in Cone-beam Computed Tomography

Journal of Digital Imaging, 2022
The interior reconstruction of completely truncated projection data is a frontier research hotspot in cone-beam computed tomography (CBCT) application. It is difficult to find a method with acceptable accuracy and high efficiency to solve it. Based on the simplified algebraic reconstruction technique (S-ART) algorithm and the filtered back projection ...
Xianchao Wang, Shaoyi Li, Changhui Hou
openaire   +2 more sources

Two wide neighborhood interior-point methods for symmetric cone optimization

Computational Optimization and Applications, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
M. Sayadi Shahraki, Hossein Mansouri, Maryam Zangiabadi   +2 more
openaire   +1 more source

Anchoring Points and Cones of Opportunities in Interior Multiobjective Linear Programming

Journal of the Operational Research Society, 1994
Summary: 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

Positivity
zbMATH 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, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Immanuel M. Bomze, Werner Schachinger
openaire   +2 more sources

Information Geometry and Interior-Point Algorithms in Semidefinite Programs and Symmetric Cone Programs

Journal of Optimization Theory and Applications, 2012
The authors consider interior-point algorithms for semi-definite programming and symmetric conic programming problems. They apply a differential geometric framework, the so-called information geometry, to these classes of problems and show relationships between complexity analysis and the curvature integral taken along the central path.
Satoshi Kakihara, Atsumi Ohara, Takashi Tsuchiya   +2 more
openaire   +2 more sources