LOQO
From MaRDI portal
Cited in
(only showing first 100 items - show all)- An XML-based schema for stochastic programs
- SICOpt: Solution approach for nonlinear integer stochastic programming problems
- On a kernel-based method for pattern recognition, regression, approximation, and operator inversion
- Robust image watermarking in the spatial domain
- Strategic financial risk management and operations research
- Computational experience with approximation algorithms for the set covering problem
- Stochastic linear programs with restricted recourse
- ALPO
- BPMPD
- An interior-point algorithm for nonconvex nonlinear programming
- Computational assessment of distributed decomposition methods for stochastic linear programs
- Integer optimization by local search. A domain-independent approach
- Steplengths in interior-point algorithms of quadratic programming
- KNITRO
- LANCELOT
- MA57
- Interior point techniques in optimization. Complementarity, sensitivity and algorithms
- SIPAMPL
- The discrete Radon transform and its approximate inversion via linear programming
- A constant-potential infeasible-start interior-point algorithm with computational experiments and applications
- QHOPDM -- a higher order primal-dual method for large scale convex quadratic programming
- Feature extraction and dimensionality reduction algorithms and their applications in vowel recognition.
- Monotone modifications of r-algorithms and their applications
- MSLiP
- rSQP++
- Financial planning via multi-stage stochastic optimization.
- ASMOD
- SNOPT
- Solving stochastic linear programs with restricted recourse using interior point methods
- Infeasible predictor-corrector interior-point method applied to image restoration in the presence of noise
- Parallel algorithms to solve two-stage stochastic linear programs with robustness constraints
- Interior-point methods for nonconvex nonlinear programming: orderings and higher-order methods
- Sequential quadratic programming for large-scale nonlinear optimization
- A Novel eigenvector technique for large scale combinatorial problems in VLSI layout
- AMPL
- SVMlight
- Difference of convex functions algorithms (DCA) for image restoration via a Markov random field model
- Solving the slate tile classification problem using a DAGSVM multiclassification algorithm based on SVM binary classifiers with a one-versus-all approach
- PVM
- A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm
- QHOPDM
- HOPDM
- GGPLAB
- Netlib
- An interior-point implementation developed and tuned for radiation therapy treatment planning
- LIPSOL
- TRON
- PCx
- filterSQP
- An interior point method for nonlinear optimization with a quasi-tangential subproblem
- PPRN
- NSIPS
- OOQP
- PDNET
- Kernel-Machines
- ipfilter
- CONV_QP
- GPDT
- SMPS reader
- MINOS
- MINQ
- FIR toolbox
- NLPHOPDM
- FFSQP(f77)
- Convergence analysis of difference-of-convex algorithm with subanalytic data
- IPM
- PFNRN
- SODAS
- TRICE
- SPARSE-QR
- Complexity and convergence certification of a block principal pivoting method for box-constrained quadratic programs
- The geometry of rank decompositions of matrix multiplication. II: \(3 \times 3\) matrices
- NMTR
- CG+
- DC programming and DCA: thirty years of developments
- Fast Fourier optimization
- Efficient algorithms for the smallest enclosing ball problem
- Detecting and approximating fault lines from randomly scattered data
- A primal-dual interior-point method to solve the optimal power flow dispatching problem
- SolvIND
- DAESOL-II
- Interior-point methods for nonconvex nonlinear programming: Filter methods and merit functions
- Mean field method for the support vector machine regression
- Case studies in trajectory optimization: trains, planes, and other pastimes
- Differentiable optimization and equation solving. A treatise on algorithmic science and the Karmarkar revolution
- QPSchur
- McIPM
- A hybrid differential dynamic programming algorithm for constrained optimal control problems. I: Theory
- CQP
- NPSOL
- A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties
- A perturbation method for solving linear semi-infinite programming problems
- DEGEN
- LSSOL
- QPOPT
- A dual gradient-projection method for large-scale strictly convex quadratic problems
- Quadratic maximization of reachable values of affine systems with diagonalizable matrix
- Learning chordal extensions
- ZQPCVX
- COPS
This page was built for software: LOQO
