The following pages link to LOQO user's manual — version 3.10 (Q4504790):
Displaying 20 items.
- Interior-point methods for nonconvex nonlinear programming: cubic regularization (Q457205) (← links)
- A binary integer program to maximize the agreement between partitions (Q734372) (← links)
- On an enumerative algorithm for solving eigenvalue complementarity problems (Q742298) (← links)
- The Cholesky factorization in interior point methods (Q815247) (← links)
- Case studies in optimization: catenary problem (Q833405) (← links)
- A heuristic for optimizing stochastic activity networks with applications to statistical digital circuit sizing (Q833427) (← links)
- Computational assessment of distributed decomposition methods for stochastic linear programs (Q1296802) (← links)
- QHOPDM -- a higher order primal-dual method for large scale convex quadratic programming (Q1390273) (← links)
- The geometry of rank decompositions of matrix multiplication. II: \(3 \times 3\) matrices (Q1739162) (← links)
- Efficient algorithms for the smallest enclosing ball problem (Q1774576) (← links)
- Using interior point solvers for optimizing progressive lens models with spherical coordinates (Q2218898) (← links)
- Solving trajectory optimization problems via nonlinear programming: the brachistochrone case study (Q2357837) (← links)
- Nonlinear optimization with GAMS /LGO (Q2460112) (← links)
- Using Interior-Point Methods within an Outer Approximation Framework for Mixed Integer Nonlinear Programming (Q2897298) (← links)
- Mixed integer nonlinear programming using interior-point methods (Q3096887) (← links)
- Sparsity in convex quadratic programming with interior point methods (Q3423592) (← links)
- LOQO:an interior point code for quadratic programming (Q4504789) (← links)
- A filter algorithm: comparison with NLP solvers (Q5459749) (← links)
- Computation of condition numbers for linear programming problems using Peña’s method (Q5475283) (← links)
- Matrix partitioning methods for interior point algorithms. (Q5955804) (← links)
