Pages that link to "Item:Q3287702"
From MaRDI portal
The following pages link to The Simplex Method for Quadratic Programming (Q3287702):
Displayed 50 items.
- An extension of Karmarkar's projective algorithm for convex quadratic programming (Q1121792) (← links)
- A geometrie representation for pairs of dual quadratic or linear programs (Q1131454) (← links)
- Computer experiments on quadratic programming algorithms (Q1154392) (← links)
- Implementing the modified LH algorithm (Q1177222) (← 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 solution to multiple linear regression problems with ordered attributes (Q1203713) (← links)
- On the removal of ill conditioning effects in the computation of optimal controls (Q1221928) (← links)
- Multilevel decomposition of nonlinear programming problems by dynamic programming (Q1253184) (← links)
- Optimization of a nonlinear dynamical system for global climate change (Q1278783) (← links)
- A diagnostic model for improving the efficiency of an existing portfolio (Q1330571) (← links)
- Simulated annealing for complex portfolio selection problems. (Q1406489) (← links)
- An energy-minimization framework for monotonic cubic spline interpolation (Q1612340) (← links)
- Application of the hypodifferential descent method to the problem of constructing an optimal control (Q1634789) (← links)
- On analyzing and detecting multiple optima of portfolio optimization (Q1716944) (← links)
- An open-source implementation of the critical-line algorithm for portfolio optimization (Q1736552) (← links)
- Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied (Q1787922) (← links)
- On FGP approach to multiobjective quadratic fractional programming problem (Q1792214) (← links)
- Robust-based interactive portfolio selection problems with an uncertainty set of returns (Q1794340) (← links)
- Maximin efficiency-robust tests and some extensions (Q1895376) (← links)
- Finding normal solutions in piecewise linear programming (Q1900115) (← links)
- Iterative schemes for the least 2-norm solution of piecewise linear programs (Q1902107) (← links)
- A method of Euclidean centers (Q1906945) (← links)
- Maximizing recyclable materials and user utility in waste collection: a linear-quadratic bilevel optimization approach (Q2047184) (← links)
- Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique (Q2076907) (← links)
- Application of the subdifferential descent method to a classical nonsmooth variational problem (Q2104288) (← links)
- On a primal-dual Newton proximal method for convex quadratic programs (Q2114815) (← links)
- New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming (Q2124794) (← links)
- The quasidifferential descent method in a control problem with nonsmooth objective functional (Q2230797) (← links)
- Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra (Q2281450) (← links)
- Solving quadratic programs to high precision using scaled iterative refinement (Q2293654) (← links)
- Open-loop control of a plant described by a system with nonsmooth right-hand side (Q2300707) (← links)
- Reconstruction of uncertain historical evolution of the polysyllablization of Chinese lexis (Q2336137) (← links)
- Bilevel linear programming (Q2368110) (← links)
- Complementary pivot theory of mathematical programming (Q2527120) (← links)
- The use of mathematica programming for solving singular and poorly conditioned systems of equations (Q2530252) (← links)
- A matrix structural theory of piecewise linear elastoplasticity with interacting yield planes (Q2539792) (← links)
- A method for approximate solutions of stationary creep problems (Q2539793) (← links)
- A combinatorial approach to convex quadratic programming (Q2539951) (← links)
- A fast quadratic programming method for solving ill-conditioned systems of equations (Q2550670) (← links)
- A minimum principle for frictionless elastic contact with application to non-Hertzian half-space contact problems (Q2554622) (← links)
- A numerically stable form of the simplex algorithm (Q2558746) (← links)
- The subdifferential descent method in a nonsmooth variational problem (Q2693790) (← links)
- Dual support method for solving convex quadratic programs (Q2786329) (← links)
- The range of the efficient frontier in multiple objective linear programming (Q3040942) (← links)
- An exposition of the (linear) complementarity problem (Q3050160) (← links)
- On maximum likelihood estimation of the center of a centrally symmetric convex domain (Q3135442) (← links)
- A new media optimizer based on the mean-variance model (Q3621495) (← links)
- Implementation of a subgradient projection algorithm (Q3660798) (← links)
- An economic equilibrium model on a multicommodity network (Q3691365) (← links)