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
- 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 General Quadratic Programming Algorithm
- A method of solution for quadratic programs
- A Parametric Method for Semidefinite 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
- 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?)
- 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)- Experiments with successive quadratic programming algorithms
- Numerical comparisons of nonlinear programming algorithms on serial and vector processors using automatic differentiation
- On an instance of the inverse shortest paths problem
- Solution of projection problems over polytopes
- A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming
- A cutting plane method for solving minimax problems in the complex plane
- A general method for calculating functions of fuzzy numbers
- qpmadr
- A new penalty function algorithm for convex quadratic programming
- Reducing bias in curve estimation by use of weights.
- Bound constrained quadratic programming via piecewise quadratic functions
- A new technique for inconsistent QP problems in the SQP method
- MERLIN-3. 0. A multidimensional optimization environment
- Orthogonal and conjugate basis methods for solving equality constrained minimization problems
- Resolving degeneracy in quadratic programming
- A strictly improving linear programming Phase I algorithm
- On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
- Local convergence analysis for the REQP algorithm using conjugate basis matrices
- Discretization methods for the solution of semi-infinite programming problems
- A Cholesky dual method for proximal piecewise linear programming
- Block-iterative surrogate projection methods for convex feasibility problems
- QHOPDM -- a higher order primal-dual method for large scale convex quadratic programming
- A general projection framework for constrained smoothing.
- Revisiting fitting monotone polynomials to data
- An algorithm for solving the minimum-norm point problem over the intersection of a polytope and an affine set
- ABS algorithms for linear equations and optimization
- Solving norm constrained portfolio optimization via coordinate-wise descent algorithms
- Nonlinear modeling and control approach to magnetic levitation ball system using functional weight RBF network-based state-dependent ARX model
- Complexity and convergence certification of a block principal pivoting method for box-constrained quadratic programs
- Improving the computational efficiency in a global formulation (GLIDE) for interactive multiobjective optimization
- Signs of divided differences yield least squares data fitting with constrained monotonicity or convexity
- Randomized algorithms for the separation of point sets and for solving quadratic programs
- Duality based domain decomposition with proportioning for the solution of free boundary problems
- Shape restricted nonparametric regression with Bernstein polynomials
- A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization
- Estimation of the mean for spatially dependent data belonging to a Riemannian manifold
- Finite element analysis of nonsmooth contact
- District heating networks -- dynamic simulation and optimal operation
- A dual gradient-projection method for large-scale strictly convex quadratic problems
- A fast design algorithm for elliptic-error and phase-error constrained LS 2-D FIR filters
- A dual simplex-type algorithm for the smallest enclosing ball of balls
- Factor and hybrid components for model-based clustering
- Nonlinear model predictive control with aggregated constraints
- Shape-constrained estimation in functional regression with Bernstein polynomials
- Bezier5YS and SHYqp: a general framework for generating data and for modeling symmetric and asymmetric orthotropic yield surfaces
- Computation for latent variable model estimation: a unified stochastic proximal framework
- Koopman operator method for solution of generalized aggregate data inverse problems
- Generalization of effective conductance centrality for egonetworks
- Applying iterated mapping to the no-three-in-a-line problem
- FBstab: a proximally stabilized semismooth algorithm for convex quadratic programming
- Numerical integration on trimmed three-dimensional domains with implicitly defined trimming surfaces
- High-order sequential simulation via statistical learning in reproducing kernel Hilbert space
- LE\textsc{o}P\textsc{art}: a particle library for FE\textsc{ni}CS
- Convex optimization techniques in compliant assembly simulation
- Sensitivity analysis with ^2-divergences
- A note on applying the BCH method under linear equality and inequality constraints
- An exterior point polynomial-time algorithm for convex quadratic programming
- Semi-nonparametric estimation of the call-option price surface under strike and time-to-expiry no-arbitrage constraints
- Methods for convex and general quadratic programming
- Application of the dual active set algorithm to quadratic network optimization
- Tuning strategy for the proximity parameter in convex minimization
- An inexact restoration strategy for the globalization of the sSQP method
- Piecewise linear approximations in nonconvex nonsmooth optimization
- Gaussian process emulators for computer experiments with inequality constraints
- A new method for interpolating in a convex subset of a Hilbert space
- A numerically stable least squares solution to the quadratic programming problem
- Solving dual problems using a coevolutionary optimization algorithm
- A linearly distributed lag estimator with \(r\)-convex coefficients
- Robust clusterwise linear regression through trimming
- An improved gradient projection-based decomposition technique for support vector machines
- Two-stage estimation of inequality-constrained marginal linear models with longitudinal data
- Design of smallest size two-dimensional linear-phase FIR filters with magnitude error constraint
- Parameter optimization using the L_ exact penalty function and strictly convex quadratic programming problems
- Shape constrained smoothing using smoothing splines
- Convex analysis in the semiparametric model with Bernstein polynomials
- A unified framework of constrained regression
- An O(n^ 3L) primal interior point algorithm for convex quadratic programming
- Quadratic distances for capacity and bi-capacity approximation and identification
- Solution of static optimal control problems in nonlinear elasticity via quadratic programming
- A dual method for solving positive definite quadratic programming
- An O(N^2) active set method for solving a parametric quadratic program
- Dual support method for solving convex quadratic programs
- Simultaneous small sample inference for linear combinations of generalized linear model parameters
- Globally convergent primal-dual active-set methods with inexact subproblem solves
- A unified mathematical programming formulation of strain driven and interior point algorithms for shakedown and limit analysis
- A feasible active set method for strictly convex quadratic problems with simple bounds
- A New Rejection Sampling Method for Truncated Multivariate Gaussian Random Variables Restricted to Convex Sets
- A note on forecasting Euro area inflation: leave-\(h\)-out cross validation combination as an alternative to model selection
- Efficient algorithms for computing the non and semi-parametric maximum likelihood estimates with panel count data
- Object library of algorithms for dynamic optimization problems: benchmarking SQP and nonlinear interior point methods
- Primal and dual active-set methods for convex quadratic programming
- Active set methods with reoptimization for convex quadratic integer programming
- scientific article; zbMATH DE number 3846335 (Why is no real title available?)
- scientific article; zbMATH DE number 3865005 (Why is no real title available?)
- A weighted gram-schmidt method for convex quadratic programming
- Optimal control of a turbulent fibre suspension flowing in a planar contraction
- scientific article; zbMATH DE number 4154218 (Why is no real title available?)
- Optimization-based limiters for the spectral element method
- Coupling traffic models on networks and urban dispersion models for simulating sustainable mobility strategies
- scientific article; zbMATH DE number 3902406 (Why is no real title available?)
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)
