A numerically stable dual method for solving strictly convex quadratic programs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4003917
- scientific article; zbMATH DE number 3982419
- A numerically stable least squares solution to the quadratic programming problem
- A Dual Method for Certain Positive Semidefinite Quadratic Programming Problems
- A dual method for solving positive definite quadratic programming
Cites work
- scientific article; zbMATH DE number 3115465 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3784219 (Why is no real title available?)
- scientific article; zbMATH DE number 3488926 (Why is no real title available?)
- scientific article; zbMATH DE number 3446698 (Why is no real title available?)
- scientific article; zbMATH DE number 883145 (Why is no real title available?)
- scientific article; zbMATH DE number 3332062 (Why is no real title available?)
- scientific article; zbMATH DE number 3363343 (Why is no real title available?)
- A General Quadratic Programming Algorithm
- A Parametric Method for Semidefinite Quadratic Programs
- A computational method for the indefinite quadratic programming problem
- A factorization method for the solution of constrained linear least squares problems allowing subsequent data changes
- A method of solution for quadratic programs
- A stable method for solving certain constrained least squares problems
- An example of cycling in a feasible point algorithm
- Ein Verfahren zur Lösung parameterabhängiger, nichtlinearer Maximum-Probleme
- Large-scale linearly constrained optimization
- Matrix factorizations in optimization of nonlinear functions subject to linear constraints
- Methods for Modifying Matrix Factorizations
- Nonlinear programming codes. Information, tests, performance
- Numerically stable methods for quadratic programming
- On the Numerical Solution of Constrained Least-Squares Problems
- Quadratic programming as an extension of classical quadratic maximization
- Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
- Simplicial methods for quadratic programming
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- The Simplex Method for Quadratic Programming
Cited in
(only showing first 100 items - show all)- Solution of projection problems over polytopes
- A unified framework of constrained regression
- A New Algorithm for Solving Strictly Convex Quadratic Programs
- On the superlinear convergence of a trust region algorithm for nonsmooth optimization
- Methods for convex and general quadratic programming
- An inexact restoration strategy for the globalization of the sSQP method
- A Cholesky dual method for proximal piecewise linear programming
- A weighted gram-schmidt method for convex quadratic programming
- Solving nonlinear programming problems with very many constraints
- Object library of algorithms for dynamic optimization problems: benchmarking SQP and nonlinear interior point methods
- A New Rejection Sampling Method for Truncated Multivariate Gaussian Random Variables Restricted to Convex Sets
- A simple new algorithm for quadratic programming with applications in statistics
- Piecewise linear approximations in nonconvex nonsmooth optimization
- Local convergence analysis for the REQP algorithm using conjugate basis matrices
- Robust clusterwise linear regression through trimming
- Emulators for stochastic simulation codes
- QPSchur: A dual, active-set, Schur-complement method for large-scale and structured convex quadratic programming
- A strictly improving linear programming Phase I algorithm
- Parameter identification in financial market models with a feasible point SQP algorithm
- Node harvest
- Semi-nonparametric estimation of the call-option price surface under strike and time-to-expiry no-arbitrage constraints
- scientific article; zbMATH DE number 3902406 (Why is no real title available?)
- Bootstrap confidence bands for the CDF using ranked-set sampling
- Shape restricted nonparametric regression with Bernstein polynomials
- An improved gradient projection-based decomposition technique for support vector machines
- Finite element analysis of nonsmooth contact
- Gaussian process emulators for computer experiments with inequality constraints
- MERLIN-3. 0. A multidimensional optimization environment
- A new method for interpolating in a convex subset of a Hilbert space
- Coupling traffic models on networks and urban dispersion models for simulating sustainable mobility strategies
- An active set strategy for solving optimization problems with up to 200,000,000 nonlinear constraints
- Block-iterative surrogate projection methods for convex feasibility problems
- A new technique for inconsistent QP problems in the SQP method
- The inverse parallel machine scheduling problem with minimum total completion time
- Solving the general quadratic programming problem in a finite number of steps
- A unified mathematical programming formulation of strain driven and interior point algorithms for shakedown and limit analysis
- Multivariate nonparametric estimation of the Pickands dependence function using Bernstein polynomials
- A parallel quadratic programming method for dynamic optimization problems
- A new algorithm for solving convex parametric quadratic programs based on graphical derivatives of solution mappings
- A dual gradient-projection method for large-scale strictly convex quadratic problems
- Hybrid metaheuristics for constrained portfolio selection problems
- Revisiting fitting monotone polynomials to data
- Shape constrained smoothing using smoothing splines
- Improving the computational efficiency in a global formulation (GLIDE) for interactive multiobjective optimization
- A general projection framework for constrained smoothing.
- CMLS
- A note on forecasting Euro area inflation: leave-\(h\)-out cross validation combination as an alternative to model selection
- scientific article; zbMATH DE number 3865005 (Why is no real title available?)
- A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization
- On an instance of the inverse shortest paths problem
- Minimal subfamilies and the probabilistic interpretation for modulus on graphs
- A tolerant algorithm for linearly constrained optimization calculations
- An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming
- A cutting plane method for solving minimax problems in the complex plane
- Primal and dual active-set methods for convex quadratic programming
- A robust implementation of a sequential quadratic programming algorithm with successive error restoration
- Conservative discretization of contact/impact problems for nearly rigid bodies
- A column generation method for inverse shortest path problems
- Convex analysis in the semiparametric model with Bernstein polynomials
- An active index algorithm for the nearest point problem in a polyhedral cone
- District heating networks -- dynamic simulation and optimal operation
- On solving the Lagrangian dual of integer programs via an incremental approach
- On fast trust region methods for quadratic models with linear constraints
- On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
- A new penalty function algorithm for convex quadratic programming
- On the consistency of regression-based Monte Carlo methods for pricing Bermudan options in case of estimated financial models
- qpmadr
- Optimal control of a turbulent fibre suspension flowing in a planar contraction
- A feasible active set method for strictly convex quadratic problems with simple bounds
- qpOASES: a parametric active-set algorithm for~quadratic programming
- Time-discretized variational formulation of non-smooth frictional contact
- A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming
- FBstab: a proximally stabilized semismooth algorithm for convex quadratic programming
- Discretization methods for the solution of semi-infinite programming problems
- Positive numerical integration methods for chemical kinetic systems
- Resolving degeneracy in quadratic programming
- Dual support method for solving convex quadratic programs
- A general trimming approach to robust cluster analysis
- Optimization-based limiters for the spectral element method
- Estimating ordered parameters by linear programming
- Design of smallest size two-dimensional linear-phase FIR filters with magnitude error constraint
- High-order sequential simulation via statistical learning in reproducing kernel Hilbert space
- Solution of static optimal control problems in nonlinear elasticity via quadratic programming
- Simultaneous small sample inference for linear combinations of generalized linear model parameters
- A dual method for solving positive definite quadratic programming
- Modeling the Cholesky factors of covariance matrices of multivariate longitudinal data
- scientific article; zbMATH DE number 4154218 (Why is no real title available?)
- A general method for calculating functions of fuzzy numbers
- scientific article; zbMATH DE number 4072720 (Why is no real title available?)
- On the minimum-norm solution of convex quadratic programming
- scientific article; zbMATH DE number 2206640 (Why is no real title available?)
- Moment preserving constrained resampling with applications to particle-in-cell methods
- Sensitivity analysis with \(\chi^2\)-divergences
- A dual decomposition of the closest point projection in incremental elasto‐plasticity using a mixed shell finite element
- Updating conjugate directions by the BFGS formula
- Minimum variance capacity identification
- Active set algorithm for mathematical programs with linear complementarity constraints
- scientific article; zbMATH DE number 3894842 (Why is no real title available?)
- Local dependence estimation using semiparametric archimedean copulas
- The sagitta method for solving linear programs
This page was built for publication: A numerically stable dual method for solving strictly convex quadratic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q59165)
