LOQO:an interior point code for quadratic programming
From MaRDI portal
Recommendations
Cites work
- A primal-dual infeasible-interior-point algorithm for linear programming
- A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points
- Affine-scaling for linear programs with free variables
- An infeasible-interior-point algorithm for linear complementarity problems
- An interior-point algorithm for nonconvex nonlinear programming
- Computational experience with a primal-dual interior point method for linear programming
- Computing projections for the Karmarkar algorithm
- CUTE
- Feasibility issues in a primal-dual interior-point method for linear programming
- scientific article; zbMATH DE number 3852305 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- On superlinear convergence of infeasible interior-point algorithms for linearly constrained convex programs
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- On the Implementation of a Primal-Dual Interior Point Method
- Optimizing over three-dimensional subspaces in an interior-point method for linear programming
- Preconditioners for Indefinite Systems Arising in Optimization
- Primal-dual methods for linear programming
- Solving symmetric indefinite systems in an interior-point method for linear programming
- Symmetric indefinite systems for interior point methods
- Symmetric Quasidefinite Matrices
- The Evolution of the Minimum Degree Ordering Algorithm
Cited in
(94)- Capturing incomplete information in resource allocation problems through numerical patterns
- SICOpt: Solution approach for nonlinear integer stochastic programming problems
- Strategic financial risk management and operations research
- 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.
- LOQO
- Infeasible predictor-corrector interior-point method applied to image restoration in the presence of noise
- Sequential quadratic programming for large-scale nonlinear optimization
- 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 primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm
- An interior-point implementation developed and tuned for radiation therapy treatment planning
- An interior point method for nonlinear optimization with a quasi-tangential subproblem
- Convergence analysis of difference-of-convex algorithm with subanalytic data
- Complexity and convergence certification of a block principal pivoting method for box-constrained quadratic programs
- DC programming and DCA: thirty years of developments
- Fast Fourier optimization
- Detecting and approximating fault lines from randomly scattered data
- Experimentally optimal \(\nu\) in support vector regression for different noise models and parameter settings
- A hybrid differential dynamic programming algorithm for constrained optimal control problems. I: Theory
- 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
- A predictor-corrector affine scaling method to train optimized extreme learning machine
- An adaptively regularized sequential quadratic programming method for equality constrained optimization
- Self-adaptive support vector machines: modelling and experiments
- Frequentist model averaging in structural equation modelling
- Interior-point solver for large-scale quadratic programming problems with bound constraints
- On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods
- A finite termination Mehrotra-type predictor-corrector algorithm
- Quadratic programming with transaction costs
- Steplength selection in interior-point methods for quadratic programming
- An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming
- A primal-dual interior-point algorithm for quadratic programming
- A predictor-corrector algorithm for linear optimization based on a modified Newton direction
- A primal-dual interior-point algorithm for nonlinear least squares constrained problems
- An efficient support vector machine learning method with second-order cone programming for large-scale problems
- The adaptation of interior point method for solving the quadratic programming problems arising in the assembly of deformable structures
- Globally convergent primal-dual active-set methods with inexact subproblem solves
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- A selective strategy for shakedown analysis of engineering structures
- Model selection approaches for non-linear system identification: a review
- Graph implementations for nonsmooth convex programs
- Infeasible interior-point methods for linear optimization based on large neighborhood
- A parallel decomposition algorithm for training multiclass kernel-based vector machines
- Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods
- Mehrotra-type predictor-corrector algorithm revisited
- Theory and applications of optimal control problems with multiple time-delays
- VLSI Placement Using Quadratic Programming and Network Partitioning Techniques
- A factorization with update procedures for a KKT matrix arising in direct optimal control
- A polynomial arc-search interior-point algorithm for convex quadratic programming
- Shakedown analysis with multidimensional loading spaces
- Interior point methods 25 years later
- Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization
- LOQO user's manual — version 3.10
- Benchmarking interior point Lp/Qp solvers
- A Newton-based method for nonconvex optimization with fast evasion of saddle points
- Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem
- Dynamic contact of a beam against rigid obstacles: convergence of a velocity-based approximation and numerical results
- Time series prediction using support vector machines, the orthogonal and the regularized orthogonal least-squares algorithms
- Accurate On-line Support Vector Regression
- A combined SQP-IPM algorithm for solving large-scale nonlinear optimization problems
- A two-level decomposition framework exploiting first and second order information for SVM training problems
- A semiparametric graphical modelling approach for large-scale equity selection
- 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
- Interior Point Methods Can Exploit Structure of Convex Piecewise Linear Functions with Application in Radiation Therapy
- An interior-point trust-funnel algorithm for nonlinear optimization
- Structured regularization for barrier NLP solvers
- Primal-dual interior-point method for thermodynamic gas-particle partitioning
- Practical implementation of an interior point nonmonotone line search filter method
- Object-oriented software for quadratic programming
- Optimizing Teardrop, an MRI sampling trajectory
- HyKKT: a hybrid direct-iterative method for solving KKT linear systems
- Shape-preserving, multiscale interpolation by bi- and multivariate cubic \(L_{1}\) splines
- A route generation algorithm for an optimal fuel routing problem between two single ports
- Fast \(L_1^kC^k\) polynomial spline interpolation algorithm with shape-preserving properties
- A projected-gradient interior-point algorithm for complementarity problems
- \(\mathcal{N}\)IPM-HLSP: an efficient interior-point method for hierarchical least-squares programs
- A random active set method for strictly convex quadratic problem with simple bounds
- Numerical lower bound shakedown analysis of engineering structures
- Fast and Exact Leave-One-Out Analysis of Large-Margin Classifiers
- Comment: Ridge Regression—Still Inspiring After 50 Years
- A practical and optimal first-order method for large-scale convex quadratic programming
- Interior point methods in the year 2025
- An efficient method for nonlinearly constrained networks
- Quadratic maximization of reachable values of stable discrete-time affine systems
- A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
- Computation of projection regression depth and its induced median
- Case studies in optimization: catenary problem
- Starting-point strategies for an infeasible potential reduction method
- A stable primal-dual approach for linear programming under nondegeneracy assumptions
- A compressed primal-dual method for generating bivariate cubic \(L_{1}\) splines
- Rigid pricing and rationally inattentive consumer
This page was built for publication: LOQO:an interior point code for quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4504789)
