Pages that link to "Item:Q59165"
From MaRDI portal
The following pages link to A numerically stable dual method for solving strictly convex quadratic programs (Q59165):
Displaying 50 items.
- CMLS (Q59166) (← links)
- Multivariate nonparametric estimation of the Pickands dependence function using Bernstein polynomials (Q73762) (← links)
- qpmadr (Q124638) (← links)
- Revisiting fitting monotone polynomials to data (Q145623) (← links)
- A note on forecasting Euro area inflation: leave-\(h\)-out cross validation combination as an alternative to model selection (Q301492) (← links)
- Primal and dual active-set methods for convex quadratic programming (Q312693) (← links)
- Optimization-based limiters for the spectral element method (Q349022) (← links)
- Coupling traffic models on networks and urban dispersion models for simulating sustainable mobility strategies (Q356095) (← links)
- The inverse parallel machine scheduling problem with minimum total completion time (Q380601) (← links)
- Bootstrap confidence bands for the CDF using ranked-set sampling (Q397239) (← links)
- Parameter identification in financial market models with a feasible point SQP algorithm (Q429503) (← links)
- qpOASES: a parametric active-set algorithm for~quadratic programming (Q482109) (← links)
- On fast trust region methods for quadratic models with linear constraints (Q499155) (← links)
- A parallel quadratic programming method for dynamic optimization problems (Q499159) (← links)
- Minimal subfamilies and the probabilistic interpretation for modulus on graphs (Q525405) (← links)
- A robust implementation of a sequential quadratic programming algorithm with successive error restoration (Q537640) (← links)
- Node harvest (Q542973) (← links)
- Active set algorithm for mathematical programs with linear complementarity constraints (Q545973) (← links)
- An active index algorithm for the nearest point problem in a polyhedral cone (Q548684) (← links)
- Updating of conjugate direction matrices using members of Broyden's family (Q689119) (← links)
- The nearest point problem in a polyhedral set and its extensions (Q694540) (← links)
- The sagitta method for solving linear programs (Q703904) (← links)
- A null-space method for computing the search direction in the general inertia-controlling method for dense quadratic programming (Q706949) (← links)
- A new algorithm for solving convex parametric quadratic programs based on graphical derivatives of solution mappings (Q710681) (← links)
- An active set strategy for solving optimization problems with up to 200,000,000 nonlinear constraints (Q731965) (← links)
- Moment preserving constrained resampling with applications to particle-in-cell methods (Q778280) (← links)
- Application of sequential quadratic programming software program to an actual problem (Q811407) (← links)
- QPSchur: A dual, active-set, Schur-complement method for large-scale and structured convex quadratic programming (Q833407) (← links)
- On solving the Lagrangian dual of integer programs via an incremental approach (Q849073) (← links)
- Partial spectral projected gradient method with active-set strategy for linearly constrained optimization (Q849145) (← links)
- Minimum variance capacity identification (Q856242) (← links)
- A tolerant algorithm for linearly constrained optimization calculations (Q910337) (← links)
- Convergence acceleration of direct trajectory optimization using novel Hessian calculation methods (Q927222) (← links)
- Estimating ordered parameters by linear programming (Q928896) (← links)
- A general trimming approach to robust cluster analysis (Q930658) (← links)
- Experiments with successive quadratic programming algorithms (Q1090233) (← links)
- Numerical comparisons of nonlinear programming algorithms on serial and vector processors using automatic differentiation (Q1116896) (← links)
- On an instance of the inverse shortest paths problem (Q1184336) (← links)
- Solution of projection problems over polytopes (Q1185491) (← links)
- A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming (Q1188288) (← links)
- A cutting plane method for solving minimax problems in the complex plane (Q1200545) (← links)
- A general method for calculating functions of fuzzy numbers (Q1206214) (← links)
- A new penalty function algorithm for convex quadratic programming (Q1278947) (← links)
- Reducing bias in curve estimation by use of weights. (Q1285485) (← links)
- A new technique for inconsistent QP problems in the SQP method (Q1298765) (← links)
- MERLIN-3. 0. A multidimensional optimization environment (Q1299612) (← links)
- Orthogonal and conjugate basis methods for solving equality constrained minimization problems (Q1312090) (← links)
- Resolving degeneracy in quadratic programming (Q1312769) (← links)
- A strictly improving linear programming Phase I algorithm (Q1312775) (← links)
- On the use of an inverse shortest paths algorithm for recovering linearly correlated costs (Q1315428) (← links)
