Results 21 to 30 of about 5,566,782 (273)
Refinements of the Erdös-Mordell inequality, Barrow’s inequality, and Oppenheim’s inequality
In this paper, we present some new refinements of the Erdös-Mordell inequality, Barrow’s inequality, and Oppenheim’s inequality. Based on verification by computer, several related interesting conjectures are put forward.
Jian Liu
doaj +1 more source
Structure-Exploiting Interior Point Methods [PDF]
Interior point methods are among the most popular techniques for large scale nonlinear optimization, owing to their intrinsic ability of scaling to arbitrary large problem sizes. Their efficiency has attracted in recent years a lot of attention due to increasing demand for large scale optimization in industry and engineering.
Jurai Kardos +2 more
openaire +3 more sources
An Improved Interior Point Algorithm for Quantile Regression
Quantile regression is a powerful statistical technique for estimating the quantiles of a conditional distribution on the values of covariates. It has been widely used in many fields.
Pan Zhao, Shenghua Yu
doaj +1 more source
On Finding a Relative Interior Point of a Polyhedral Set [PDF]
This paper proposes a new linear program for finding a relative interior point of a polyhedral set. Based on characterizing the relative interior of a polyhedral set through its polyhedral representing sets, two main contributions are made.
Mahmood Mehdiloo
doaj +1 more source
New Refinements of the Erdös–Mordell Inequality and Barrow’s Inequality
In this paper, two new refinements of the Erdös−Mordell inequality and three new refinements of Barrow’s inequality are established. Some related interesting conjectures are put forward.
Jian Liu
doaj +1 more source
On some new geometrically motivated operators over intuitionistic fuzzy sets [PDF]
We consider four new geometrically motivated operators acting in the interior of the interpretation triangle used to depict intuitionistic fuzzy sets.
Peter Vassilev +4 more
doaj +1 more source
Learning to steer nonlinear interior-point methods
Interior-point or barrier methods handle nonlinear programs by sequentially solving barrier subprograms with a decreasing sequence of barrier parameters.
Renke Kuhlmann
doaj +1 more source
Improved Full-Newton-Step Infeasible Interior-Point Method for Linear Complementarity Problems
We present an Infeasible Interior-Point Method for monotone Linear Complementarity Problem (LCP) which is an improved version of the algorithm given in [13]. In the earlier version, each iteration consisted of one feasibility step and few centering steps.
Goran Lešaja, Mustafa Ozen
doaj +1 more source
The Symbolic Interior Point Method
Numerical optimization is arguably the most prominent computational framework in machine learning and AI. It can be seen as an assembly language for hard combinatorial problems ranging from classification and regression in learning, to computing optimal policies and equilibria in decision theory, to entropy minimization in information ...
Mladenov, Martin +2 more
openaire +5 more sources
On the relationship between bilevel decomposition algorithms and direct interior-point methods [PDF]
Engineers have been using bilevel decomposition algorithms to solve certain nonconvex large-scale optimization problems arising in engineering design projects.
Miguel, Angel Víctor de +3 more
core +1 more source

