LOQO:an interior point code for quadratic programming

DOI10.1080/10556789908805759zbMath0973.90518OpenAlexW2069426496MaRDI QIDQ4504789

Publication date: 9 December 2001

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556789908805759

zbMATH Keywords

software package linear and quadratic programming convex and general nonlinear prograsnming

Mathematics Subject Classification ID

Nonlinear programming (90C30) Quadratic programming (90C20) Linear programming (90C05) Packaged methods for numerical algorithms (65Y15)

Related Items

HyKKT: a hybrid direct-iterative method for solving KKT linear systems, Computation of projection regression depth and its induced median, Case studies in optimization: catenary problem, Interior-point solver for large-scale quadratic programming problems with bound constraints, Time series prediction using support vector machines, the orthogonal and the regularized orthogonal least-squares algorithms, Algorithms and Software for Convex Mixed Integer Nonlinear Programs, Experimentally optimal \(\nu\) in support vector regression for different noise models and parameter settings, Infeasible interior-point methods for linear optimization based on large neighborhood, Starting-point strategies for an infeasible potential reduction method, On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods, Linear systems arising in interior methods for convex optimization: a symmetric formulation with bounded condition number, A globally convergent regularized interior point method for constrained optimization, A stable primal-dual approach for linear programming under nondegeneracy assumptions, 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, A finite termination Mehrotra-type predictor-corrector algorithm, Quadratic programming with transaction costs, Accurate On-line Support Vector Regression, Interior Point Methods Can Exploit Structure of Convex Piecewise Linear Functions with Application in Radiation Therapy, A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm, Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods, A compressed primal-dual method for generating bivariate cubic \(L_{1}\) splines, A polynomial arc-search interior-point algorithm for linear programming, Theory and applications of optimal control problems with multiple time-delays, A factorization with update procedures for a KKT matrix arising in direct optimal control, A selective strategy for shakedown analysis of engineering structures, An interior-point implementation developed and tuned for radiation therapy treatment planning, A route generation algorithm for an optimal fuel routing problem between two single ports, An interior point method for nonlinear optimization with a quasi-tangential subproblem, A hybrid differential dynamic programming algorithm for constrained optimal control problems. I: Theory, Rigid pricing and rationally inattentive consumer, Unnamed Item, Feature extraction and dimensionality reduction algorithms and their applications in vowel recognition., A polynomial arc-search interior-point algorithm for convex quadratic programming, Fast \(L_1^kC^k\) polynomial spline interpolation algorithm with shape-preserving properties, Shakedown analysis with multidimensional loading spaces, A projected-gradient interior-point algorithm for complementarity problems, Interior point methods 25 years later, A Newton-Based Method for Nonconvex Optimization with Fast Evasion of Saddle Points, Mehrotra-type predictor-corrector algorithm revisited, Dynamic contact of a beam against rigid obstacles: convergence of a velocity-based approximation and numerical results, Numerical lower bound shakedown analysis of engineering structures, Convergence analysis of difference-of-convex algorithm with subanalytic data, Steplength selection in interior-point methods for quadratic programming, Complexity and convergence certification of a block principal pivoting method for box-constrained quadratic programs, Model selection approaches for non-linear system identification: a review, A combined SQP-IPM algorithm for solving large-scale nonlinear optimization problems, An interior-point trust-funnel algorithm for nonlinear optimization, An adaptively regularized sequential quadratic programming method for equality constrained optimization, DC programming and DCA: thirty years of developments, Structured regularization for barrier NLP solvers, An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming, Primal-dual interior-point method for thermodynamic gas-particle partitioning, Fast Fourier optimization, VLSI Placement Using Quadratic Programming and Network Partitioning Techniques, A dual gradient-projection method for large-scale strictly convex quadratic problems, Shape-preserving, multiscale interpolation by bi- and multivariate cubic \(L_{1}\) splines, An efficient method for nonlinearly constrained networks, Detecting and approximating fault lines from randomly scattered data, Self-adaptive support vector machines: modelling and experiments, Graph Implementations for Nonsmooth Convex Programs, A primal-dual interior-point algorithm for quadratic programming, Quadratic maximization of reachable values of affine systems with diagonalizable matrix, A predictor-corrector algorithm for linear optimization based on a modified Newton direction, A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step, Practical implementation of an interior point nonmonotone line search filter method, Learning chordal extensions, Capturing incomplete information in resource allocation problems through numerical patterns, LOQO, Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem, A parallel decomposition algorithm for training multiclass kernel-based vector machines, Strategic financial risk management and operations research, Globally Convergent Primal-Dual Active-Set Methods with Inexact Subproblem Solves, A predictor-corrector affine scaling method to train optimized extreme learning machine, Infeasible predictor-corrector interior-point method applied to image restoration in the presence of noise, SICOpt: Solution approach for nonlinear integer stochastic programming problems, Frequentist model averaging in structural equation modelling, A semiparametric graphical modelling approach for large-scale equity selection, A primal-dual interior-point algorithm for nonlinear least squares constrained problems, Optimizing Teardrop, an MRI sampling trajectory, An efficient support vector machine learning method with second-order cone programming for large-scale problems, Sequential quadratic programming for large-scale nonlinear optimization, Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization

Uses Software

NETLIB LP Test Set

Cites Work