Results 1 to 10 of about 150,746 (153)
Primal-dual interior point QP-free algorithm for nonlinear constrained optimization [PDF]
In this paper, a class of nonlinear constrained optimization problems with both inequality and equality constraints is discussed. Based on a simple and effective penalty parameter and the idea of primal-dual interior point methods, a QP-free algorithm ...
Jinbao Jian +3 more
doaj +2 more sources
An Inexact Feasible Quantum Interior Point Method for Linearly Constrained Quadratic Optimization [PDF]
Quantum linear system algorithms (QLSAs) have the potential to speed up algorithms that rely on solving linear systems. Interior point methods (IPMs) yield a fundamental family of polynomial-time algorithms for solving optimization problems. IPMs solve a
Zeguan Wu +4 more
doaj +2 more sources
On the relationship of interior-point methods
In this paper, we show that the moving directions of the primal-affine scaling method (with logarithmic barrier function), the dual-affine scaling method (with logarithmic barrier function), and the primal-dual interior point method are merely the Newton
Ruey-Lin Sheu, Shu-Cherng Fang
doaj +2 more sources
An Interior-Point Method for Semidefinite Programming [PDF]
We propose a new interior-point-based method to minimize a linear function of a matrix variable subject to linear equality and inequality constraints over the set of positive semidefinite matrices. We show that the approach is very efficient for graph bisection problems such as max–cut.
Christoph Helmberg +2 more
exaly +3 more sources
Quantum Interior Point Methods for Semidefinite Optimization [PDF]
We present two quantum interior point methods for semidefinite optimization problems, building on recent advances in quantum linear system algorithms. The first scheme, more similar to a classical solution algorithm, computes an inexact search direction ...
Brandon Augustino +3 more
doaj +1 more source
The purpose of the current investigation is to find the numerical solutions of the novel fractional order pantograph singular system (FOPSS) using the applications of Meyer wavelets as a neural network.
Zulqurnain Sabir +3 more
doaj +1 more source
Sparse Approximations with Interior Point Methods [PDF]
Large-scale optimization problems that seek sparse solutions have become ubiquitous. They are routinely solved with various specialized first-order methods. Although such methods are often fast, they usually struggle with not-so-well-conditioned problems.
Valentina De Simone +4 more
openaire +6 more sources
Counting the Interior Points of a Point Configuration [PDF]
Let \(A\) be a collection of points in \(\mathbb{R}^d\) whose affine span is \(\mathbb{R}^d\), and \(\text{int}(A)\) the set of points in \(A\) that lie in the interior of its convex hull \(\text{conv}(A)\). A subset \(K\subseteq A\) is called free if \(\text{conv} (K)\cap A=K\) and the set of vertices of \(\text{conv}(K)\) is \(K\).
Paul H. Edelman, Victor Reiner
openaire +2 more sources
Boundary Matching and Interior Connectivity-Based Cluster Validity Anlysis
The evaluation of clustering results plays an important role in clustering analysis. However, the existing validity indices are limited to a specific clustering algorithm, clustering parameter, and assumption in practice.
Qi Li +5 more
doaj +1 more source
Interior Point Algorithm in Multi-objective Portfolio Optimization: GlueVaR Approach [PDF]
Objective Investors, in their pursuit to maximize expected returns, minimize risks in their stock portfolios, and achieve the desired benefits, require suitable methods and criteria to select stocks for their portfolios and allocate capital.
Elaheh Gohania +2 more
doaj +1 more source

