LOQO

swMATH2212MaRDI QIDQ14756FDOQ14756

Author name not available (Why is that?)

Official website: http://www.princeton.edu/~rvdb/

Described by source

• LOQO:an interior point code for quadratic programming

Cited In (only showing first 100 items - show all)

• Barrier function based model predictive control
• A filter algorithm: comparison with NLP solvers
• Primal-dual interior-point method for thermodynamic gas-particle partitioning
• Computation of projection regression depth and its induced median
• A heuristic for optimizing stochastic activity networks with applications to statistical digital circuit sizing
• Case studies in optimization: catenary problem
• Robust image watermarking in the spatial domain
• Title not available (Why is that?)
• A non-interior-point smoothing method for variational inequality problem
• An interface optimization and application for the numerical solution of optimal control problems
• Monotone modifications of \(r\)-algorithms and their applications
• Solving the slate tile classification problem using a DAGSVM multiclassification algorithm based on SVM binary classifiers with a one-versus-all approach
• Integer optimization by local search. A domain-independent approach
• Numerical experiments with an interior-exterior point method for nonlinear programming
• Time series prediction using support vector machines, the orthogonal and the regularized orthogonal least-squares algorithms
• Mesh shape-quality optimization using the inverse mean-ratio metric
• Stochastic linear programs with restricted recourse
• Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem
• Title not available (Why is that?)
• DC programming and DCA: thirty years of developments
• Computer Vision - ECCV 2004
• A globally convergent regularized interior point method for constrained optimization
• Computational assessment of distributed decomposition methods for stochastic linear programs
• Financial planning via multi-stage stochastic optimization.
• An interior-point method for nonlinear optimization problems with locatable and separable nonsmoothness
• A constant-potential infeasible-start interior-point algorithm with computational experiments and applications
• Fast Numerical Methods for Mixed-Integer Nonlinear Model-Predictive Control
• Integer linear programming models for global routing
• Spectral projected gradient and variable metric methods for optimization with linear inequalities
• Computation of condition numbers for linear programming problems using Peña’s method
• A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties
• Rigid pricing and rationally inattentive consumer
• Title not available (Why is that?)
• Title not available (Why is that?)
• Feature extraction and dimensionality reduction algorithms and their applications in vowel recognition.
• Detecting and approximating fault lines from randomly scattered data
• SICOpt: Solution approach for nonlinear integer stochastic programming problems
• Title not available (Why is that?)
• A Chebyshev technique for the solution of optimal control problems with nonlinear programming methods
• Hierarchical learning in polynomial support vector machines
• Steplengths in interior-point algorithms of quadratic programming
• Solving stochastic linear programs with restricted recourse using interior point methods
• Title not available (Why is that?)
• Sequential quadratic programming for large-scale nonlinear optimization
• Title not available (Why is that?)
• A primal-dual interior-point method to solve the optimal power flow dispatching problem
• Infeasible predictor-corrector interior-point method applied to image restoration in the presence of noise
• Matrix partitioning methods for interior point algorithms.
• Interior point models for power system stability problems
• Stability of Linear Equations Solvers in Interior-Point Methods
• Efficient Computation and Model Selection for the Support Vector Regression
• Structured regularization for barrier NLP solvers
• Theory and applications of optimal control problems with multiple time-delays
• Interior point methods 25 years later
• Comparison and Automated Selection of Local Optimization Solvers for Interval Global Optimization Methods
• An introduction to support vector machines and other kernel-based learning methods.
• The discrete Radon transform and its approximate inversion via linear programming
• Graph implementations for nonsmooth convex programs
• On the efficiency of multiplier methods for nonlinear network problems with nonlinear constraints
• ALPO
• BPMPD
• KNITRO
• LANCELOT
• MA57
• SIPAMPL
• MSLiP
• rSQP++
• A repository of convex quadratic programming problems
• ASMOD
• SNOPT
• AMPL
• GGPLAB
• HOPDM
• PVM
• SVMlight
• QHOPDM
• Netlib
• filterSQP
• LIPSOL
• CONV_QP
• Kernel-Machines
• ipfilter
• PCx
• NSIPS
• GPDT
• OOQP
• PPRN
• PDNET
• SMPS reader
• TRON
• FIR toolbox
• FFSQP(f77)
• MINOS
• MINQ
• IPM
• NLPHOPDM
• CG+
• PFNRN
• SODAS
• NMTR

This page was built for software: LOQO