The following pages link to (Q4382667):
Displaying 50 items.
- Note on implementing the new sphere method for LP using matrix inversions sparingly (Q1001333) (← links)
- Average case complexity results for a centering algorithm for linear programming problems under Gaussian distributions (Q1002052) (← links)
- A polynomial-time algorithm for linear optimization based on a new class of kernel functions (Q1002187) (← links)
- Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function (Q1002309) (← links)
- A redundant Klee-Minty construction with all the redundant constraints touching the feasible region (Q1003486) (← links)
- Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming (Q1012253) (← links)
- Partitioning multiple objective optimal solutions with applications in radiotherapy design (Q1027150) (← links)
- Stabilized column generation (Q1297485) (← links)
- Euclidean Jordan algebras and interior-point algorithms (Q1383772) (← links)
- Specialized fast algorithms for IQC feasibility and optimization problems. (Q1428693) (← links)
- A primal-dual interior point method for parametric semidefinite programming problems (Q1568250) (← links)
- Interior-point methods (Q1593831) (← links)
- An SQP method for general nonlinear complementarity problems (Q1595262) (← links)
- A new algorithm for geometric programming based on the linear structure of its dual problem. (Q1597169) (← links)
- Pivot versus interior point methods: Pros and cons (Q1598748) (← links)
- Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier (Q1616941) (← links)
- An optimal approach for the critical node problem using semidefinite programming (Q1620469) (← links)
- A full Nesterov-Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization (Q1644574) (← links)
- A superlinearly convergent wide-neighborhood predictor-corrector interior-point algorithm for linear programming (Q1677164) (← links)
- Complexity analysis of a full-{N}ewton step interior-point method for linear optimization (Q1677554) (← links)
- Bin packing under linear constraints (Q1679514) (← links)
- Knapsack with variable weights satisfying linear constraints (Q1683329) (← links)
- Autonomous trajectory planning for space vehicles with a Newton-Kantorovich/convex programming approach (Q1687355) (← links)
- The flattened aggregate constraint homotopy method for nonlinear programming problems with many nonlinear constraints (Q1724113) (← links)
- Complexity of interior point methods for a class of linear complementarity problems using a kernel function with trigonometric growth term (Q1730836) (← links)
- A mixed 0--1 LP for index tracking problem with CVaR risk constraints (Q1761842) (← links)
- The asymptotic optimal partition and extensions of the nonsubstitution theorem (Q1765893) (← links)
- On self-regular IPMs (with comments and rejoinder) (Q1769946) (← links)
- Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood (Q1787924) (← links)
- A new class of polynomial primal-dual methods for linear and semidefinite optimization (Q1848379) (← links)
- Analytic centers and repelling inequalities (Q1848382) (← links)
- Interior-point methods: Worst case and average case analysis of a phase-I algorithm and a termination procedure. (Q1872636) (← links)
- A level set approach for the solution of a state-constrained optimal control problem (Q1882557) (← links)
- On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming (Q1928305) (← links)
- Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems (Q1947198) (← links)
- Second-order cone interior-point method for quasistatic and moderate dynamic cohesive fracture (Q1989097) (← links)
- A survey on the high convergence orders and computational convergence orders of sequences (Q2008170) (← links)
- A full-Newton step infeasible interior-point algorithm based on darvay directions for linear optimization (Q2016468) (← links)
- Linear operators and positive semidefiniteness of symmetric tensor spaces (Q2018916) (← links)
- A new parameterized logarithmic kernel function for linear optimization with a double barrier term yielding the best known iteration bound (Q2038473) (← links)
- A full-Newton step infeasible interior-point method for the special weighted linear complementarity problem (Q2046555) (← links)
- A wide neighborhood interior-point algorithm based on the trigonometric kernel function (Q2053067) (← links)
- An interior-point algorithm for linear programming with optimal selection of centering parameter and step size (Q2059175) (← links)
- An infeasible interior-point arc-search algorithm for nonlinear constrained optimization (Q2066199) (← links)
- A full-modified-Newton step \(O(n)\) infeasible interior-point method for the special weighted linear complementarity problem (Q2086935) (← links)
- A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs (Q2105288) (← links)
- Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems (Q2115211) (← links)
- An interior-point algorithm for semidefinite least-squares problems. (Q2148405) (← links)
- A logarithmic barrier interior-point method based on majorant functions for second-order cone programming (Q2174912) (← links)
- The multiproximal linearization method for convex composite problems (Q2191762) (← links)
