Pages that link to "Item:Q1121792"
From MaRDI portal
The following pages link to An extension of Karmarkar's projective algorithm for convex quadratic programming (Q1121792):
Displaying 50 items.
- A logarithmic barrier approach for linear programming (Q329787) (← links)
- A polynomial arc-search interior-point algorithm for convex quadratic programming (Q421610) (← links)
- CECM: constrained evidential \(C\)-means algorithm (Q433252) (← links)
- An interior-exterior approach for convex quadratic programming (Q436003) (← links)
- Exterior point algorithms for nearest points and convex quadratic programs (Q687081) (← links)
- An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming (Q687091) (← links)
- Approximation algorithms for indefinite quadratic programming (Q687094) (← links)
- A convergence proof for an affine-scaling algorithm for convex quadratic programming without nondegeneracy assumptions (Q688916) (← links)
- New augmented Lagrangian-based proximal point algorithm for convex optimization with equality constraints (Q727234) (← links)
- Computational complexity of norm-maximization (Q757258) (← links)
- Algorithms for the solution of quadratic knapsack problems (Q806968) (← links)
- Newton-KKT interior-point methods for indefinite quadratic programming (Q885826) (← links)
- On solving \(L_{q}\)-penalized regressions (Q933880) (← links)
- Extension of a projective interior point method for linearly constrained convex programming (Q990634) (← links)
- A class of linear complementarity problems solvable in polynomial time (Q1174838) (← links)
- On affine scaling algorithms for nonconvex quadratic programming (Q1196182) (← links)
- Generalization of Karmarkar's algorithm to convex homogeneous functions (Q1197885) (← links)
- An interior point method for quadratic programs based on conjugate projected gradients (Q1260618) (← links)
- Duallity and sensitivity in nonconvex quadratic optimization over an ellipsoid (Q1278289) (← links)
- A new penalty function algorithm for convex quadratic programming (Q1278947) (← links)
- Global convergence of the affine scaling algorithm for primal degenerate strictly convex quadratic programming problems (Q1312782) (← links)
- An \(O(n^ 3 L)\) primal-dual potential reduction algorithm for solving convex quadratic programs (Q1315412) (← links)
- A branch bound method for subset sum problem (Q1343509) (← links)
- Duality in robust linear regression using Huber's \(M\)-estimator (Q1372307) (← links)
- Trust region affine scaling algorithms for linearly constrained convex and concave programs (Q1380941) (← links)
- Monotone variable-metric algorithm for linearly constrained nonlinear programming (Q1579655) (← links)
- Novel interior point algorithms for solving nonlinear convex optimization problems (Q1748456) (← links)
- Convergence properties of Dikin's affine scaling algorithm for nonconvex quadratic minimization (Q1777447) (← links)
- Nonmonotonic back-tracking trust region interior point algorithm for linear constrained optimization (Q1811590) (← links)
- Computational schemes for large-scale problems in extended linear- quadratic programming (Q1813335) (← links)
- Is a finite intersection of balls covered by a finite union of balls in Euclidean spaces? (Q2025288) (← links)
- Optimal pricing policy design for selling cost-reducing innovation in Cournot games (Q2067618) (← links)
- A positive and stable L2-minimization based moment method for the Boltzmann equation of gas dynamics (Q2129337) (← links)
- A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints (Q2147941) (← links)
- Robustness to rank reversal in pairwise comparison matrices based on uncertainty bounds (Q2171613) (← links)
- On tail dependence matrices. The realization problem for parametric families (Q2191424) (← links)
- Polynomial-time algorithms for submodular Laplacian systems (Q2235770) (← links)
- On the convergence analysis of arc search interior point methods for LCPs (Q2337791) (← links)
- An exterior point polynomial-time algorithm for convex quadratic programming (Q2340489) (← links)
- Two-stage estimation of inequality-constrained marginal linear models with longitudinal data (Q2480042) (← links)
- An affine scaling projective reduced Hessian algorithm for minimum optimization with nonlinear equality and linear inequality constraints (Q2485615) (← links)
- An affine scaling interior trust-region method for \(LC^{1}\) minimization subject to bounds on variables (Q2489419) (← links)
- An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function (Q2634322) (← links)
- An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming (Q2638936) (← links)
- An interior point algorithm for global optimal solutions and KKT points (Q2770190) (← links)
- A Coordinate Ascent Method for Solving Semidefinite Relaxations of Non-convex Quadratic Integer Programs (Q2835666) (← links)
- A wide neighborhood arc-search interior-point algorithm for convex quadratic programming (Q3176174) (← links)
- An Infeasible Mizuno–Todd–Ye Type Algorithm for Convex Quadratic Programming with Polynomial Complexity (Q3444677) (← links)
- Generalized sensitivity analysis of nonlinear programs using a sequence of quadratic programs (Q4634162) (← links)
- A new potential reduction algorithm for smooth convex programming (Q4944415) (← links)
