The following pages link to (Q4296156):
Displaying 30 items.
- Applications of one-shot methods in PDEs constrained shape optimization (Q2654365) (← links)
- Long-step path-following algorithm for quantum information theory: some numerical aspects and applications (Q2673269) (← links)
- Complexity analysis of interior point methods for linear programming based on a parameterized kernel function (Q2954362) (← links)
- A Class of Infeasible Interior Point Algorithms for Convex Quadratic Programming (Q3068659) (← links)
- Sparsity in convex quadratic programming with interior point methods (Q3423592) (← links)
- Generic Primal-dual Interior Point Methods Based on a New Kernel Function (Q3539807) (← links)
- Interior Point Methods for Nonlinear Optimization (Q3569506) (← links)
- A new primal-dual path-following interior-point algorithm for linearly constrained convex optimization (Q3640925) (← links)
- Logarithmic Barrier Decomposition Methods for Semi-infinite Programming (Q3842985) (← links)
- A generalized interior-point barrier function approach for smooth convex programming with linear constraints (Q4264497) (← links)
- Asymptotic analysis of a path-following barrier method for linearly constrained convex problems<sup>*</sup> (Q4265517) (← links)
- (Q4382667) (← links)
- Computing Maximum Likelihood Estimators of Convex Density Functions (Q4389265) (← links)
- A primal‐dual interior-point method for linear optimization based on a new proximity function (Q4405935) (← links)
- Generalized sensitivity analysis of nonlinear programs using a sequence of quadratic programs (Q4634162) (← links)
- Primal interior-point decomposition algorithms for two-stage stochastic extended second-order cone programming (Q4646557) (← links)
- Polynomial Interior Point Cutting Plane Methods (Q4653547) (← links)
- Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem (Q4715798) (← links)
- (Q5061832) (← links)
- INTERIOR POINT METHOD FOR SOLVING LINEAR PROGRAMMING WITH INTERVAL COEFFICIENTS USING AFFINE SCALING (Q5237589) (← links)
- High-Dimensional Data Classification (Q5270620) (← links)
- Hessian distances and their applications in the complexity analysis of interior-point methods (Q5299911) (← links)
- A new primal-dual interior-point algorithm for convex quadratic optimization (Q5320227) (← links)
- A Numerical Implementation of an Interior Point Methods for Linear Programming Based on a New Kernel Function (Q5356999) (← links)
- Theoretical and Numerical Result for Linear Optimization Problem Based on a New Kernel Function (Q5853368) (← links)
- Why the logarithmic barrier function in convex and linear programming? (Q5929144) (← links)
- An easy way to teach interior-point methods. (Q5932020) (← links)
- Substantiation of interior point algorithms (Q5932879) (← links)
- Maintaining closeness to the analytic center of a polytope by perturbing added hyperplanes (Q5961567) (← links)
- An infeasible interior-point technique to generate the nondominated set for multiobjective optimization problems (Q6164611) (← links)
