The following pages link to (Q5691079):
Displaying 50 items.
- A full-Newton step infeasible interior-point algorithm for \(P_\ast (\kappa)\) linear complementarity problem (Q890633) (← links)
- An interior-point \(\ell_{\frac{1}{2}}\)-penalty method for inequality constrained nonlinear optimization (Q898716) (← links)
- A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization (Q905304) (← links)
- Efficient robust optimization for robust control with constraints (Q925268) (← links)
- Superlinear convergence of the control reduced interior point method for PDE constrained optimization (Q941805) (← links)
- Direct analytical solution of a modified form of the meshing equations in two dimensions for non-conjugate gear contact (Q949997) (← links)
- Semidefinite programming for the educational testing problem (Q953303) (← links)
- A comparison of solvers for linear complementarity problems arising from large-scale masonry structures. (Q954579) (← links)
- Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems (Q979273) (← links)
- A globally convergent non-interior point algorithm with full Newton step for second-order cone programming (Q993313) (← links)
- Multiphase image segmentation and modulation recovery based on shape and topological sensitivity (Q993539) (← links)
- Adaptive large-neighborhood self-regular predictor-corrector interior-point methods for linear optimization (Q995953) (← links)
- Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions (Q997220) (← links)
- An algorithm for the fast solution of symmetric linear complementarity problems (Q998634) (← links)
- Note on implementing the new sphere method for LP using matrix inversions sparingly (Q1001333) (← 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)
- Predictive control for hybrid systems. Implications of polyhedral pre-computations (Q1003540) (← links)
- Warmstarting for interior point methods applied to the long-term power planning problem (Q1011271) (← links)
- Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming (Q1012253) (← links)
- Recovering a probabilistic knowledge structure by constraining its parameter space (Q1013055) (← links)
- Performance bounds for linear stochastic control (Q1016592) (← links)
- Numerical simulation of contact problems in vane machinery by a parametric quadratic programming method (Q1020310) (← links)
- Partitioning multiple objective optimal solutions with applications in radiotherapy design (Q1027150) (← links)
- Convergence analysis of the inexact infeasible interior-point method for linear optimization (Q1028608) (← links)
- Primal central paths and Riemannian distances for convex sets (Q1029546) (← links)
- Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension (Q1029621) (← links)
- Further development of multiple centrality correctors for interior point methods (Q1029632) (← links)
- A Newton-like method for nonlinear system of equations (Q1039287) (← links)
- SICOpt: Solution approach for nonlinear integer stochastic programming problems (Q1039361) (← links)
- Applications of second-order cone programming (Q1124764) (← links)
- Condition measures and properties of the central trajectory of a linear program (Q1290648) (← links)
- Warm start of the primal-dual method applied in the cutting-plane scheme (Q1290656) (← links)
- Dynamic programming method for constrained discrete-time optimal control (Q1291816) (← links)
- Steplengths in interior-point algorithms of quadratic programming (Q1306349) (← links)
- Incomplete orthogonalization preconditioners for solving large and dense linear systems which arise from semidefinite programming (Q1349146) (← links)
- Long-step strategies in interior-point primal-dual methods (Q1361105) (← links)
- Criss-cross methods: A fresh view on pivot algorithms (Q1365063) (← links)
- On the minimum norm solution of linear programs (Q1411463) (← links)
- An optimization approach to multiple sequence alignment (Q1431885) (← links)
- Infeasible predictor-corrector interior-point method applied to image restoration in the presence of noise (Q1573984) (← links)
- Galton, Edgeworth, Frisch, and prospects for quantile regression in econometrics (Q1574221) (← links)
- Analytic solutions and triality theory for nonconvex and nonsmooth variational problems with applications (Q1586659) (← links)
- On improved Choi-Goldfarb solution-containing ellipsoids in linear programming (Q1591595) (← links)
- Piecewise linear methods for nonlinear equations and optimization (Q1593829) (← links)
- Interior-point methods (Q1593831) (← links)
- A new algorithm for geometric programming based on the linear structure of its dual problem. (Q1597169) (← links)
- A theory of complexity for continuous time systems (Q1599194) (← links)
- Parallel interior-point method for linear and quadratic programs with special structure (Q1608140) (← links)
- Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier (Q1616941) (← links)
