Results 31 to 40 of about 17,647,919 (136)
Local quadratic convergence of polynomial-time interior-point methods for conic optimization problems [PDF]
In this paper, we establish a local quadratic convergence of polynomial-time interior-point methods for general conic optimization problems. The main structural property used in our analysis is the logarithmic homogeneity of self-concordant barrier ...
NESTEROV, Yu., TUNCEL, Levent
core
Analysis of Interior-Point Paths
, 2006 Infeasible-interior-point paths are the main tools in interior-point methods for solving many kinds of optimization problems. These paths are usually parametrized by a penalty-parameter r down arrow 0 and further parameters describing their off ...
Stoer, J.
core +1 more source
, 1999 Interior point method(IPM) 의 전반적인 발달과정을 살펴보고 IPM의 한 방법인 infeasible-primal-dual algorithm언급한다. 이 방법을 이용한 package인 LIPSOL(linear programming interior-point solvers)의 효율성을 보인다.
오정은
core +1 more source
An infeasible-interior-point method for the \(P_\ast(k)\) -matrix LCP
Journal of Numerical Analysis and Approximation Theory, 1998 Not available.
Jun Ji, Florian A. Potra
openaire +2 more sources
COUNTER EXAMPLE TO A CONJECTURE ON INFEASIBLE INTERIOR-POINT METHODS
, 2014 . Based on extensive computational evidence (hundreds of thousands of randomly generated problems) the second author conjectured that ¯κ(ζ) = 1 (Conjecture 5.1 in [1]), which is a factor of √ 2n better than has been proved in [1], and which would yield ...
G. Gu, C. Roos
core
, 2006 Semidefinite Programming (SDP) involves the optimization of a linear cost function subject to linear constraints over symmetric positive semidefinite matrix variables.
Qian Xia
core
, 2012 We introduce a full NT-step infeasible interior-point algorithm for semidefinite optimization based on a self-regular function to provide the feasibility step and to measure proximity to the central path.
Kheirfam, B.
core +1 more source
An Interior-Point algorithm for Nonlinear Minimax Problems [PDF]
We present a primal-dual interior-point method for constrained nonlinear, discrete minimax problems where the objective functions and constraints are not necessarily convex.
E. Obasanjo, G. Tzallas-Regas, B. Rustem
core
Structure-Preserving Excess Gibbs Learning for Multicomponent Phase Equilibria: A Falsifiable and Uncertainty-Aware Synthetic Study. [PDF]
Int J Mol SciRobles P +3 more
europepmc +1 more source
Siphon Calculus and Lyapunov Functions for Generalized Lotka-Volterra Systems: A Reaction Networks Perspective. [PDF]
Entropy (Basel)Avram F.
europepmc +1 more source