An exterior point polynomial-time algorithm for convex quadratic programming (Q2340489): Difference between revisions

@@ Property / DOI @@
-.1007/s10589-014-9710-8
@@ Property / DOI: 10.1007/s10589-014-9710-8 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10589-014-9710-8
+Normal rank
@@ Property / OpenAlex ID @@
+W1965698129
@@ Property / OpenAlex ID: W1965698129 / rank @@
+Normal rank
@@ Property / cites work @@
+A new polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+An \(O(n^ 3 L)\) primal-dual potential reduction algorithm for solving convex quadratic programs
+Normal rank
@@ Property / cites work @@
+An extension of Karmarkar's projective algorithm for convex quadratic programming
+Normal rank
@@ Property / cites work @@
+An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming
+Normal rank
@@ Property / cites work @@
+Interior path following primal-dual algorithms. II: Convex quadratic programming
+Normal rank
@@ Property / cites work @@
+Q3033554
@@ Property / cites work: Q3033554 / rank @@
+Normal rank
@@ Property / cites work @@
+Interior path following primal-dual algorithms. I: Linear programming
+Normal rank
@@ Property / cites work @@
+An Algorithm for Convex Quadratic Programming That Requires <i>O</i>(<i>n</i><sup>3.5</sup><i>L</i>) Arithmetic Operations
+Normal rank
@@ Property / cites work @@
+On the convergence of the method of analytic centers when applied to convex quadratic programs
+Normal rank
@@ Property / cites work @@
+A polynomial-time algorithm, based on Newton's method, for linear programming
+Normal rank
@@ Property / cites work @@
+A new primal-dual path-following method for convex quadratic programming
+Normal rank
@@ Property / cites work @@
+Convergence analysis of an inexact potential reduction method for convex quadratic programming
+Normal rank
@@ Property / cites work @@
+A polynomial arc-search interior-point algorithm for convex quadratic programming
+Normal rank
@@ Property / cites work @@
+A predictor-corrector algorithm with multiple corrections for convex quadratic programming
+Normal rank
@@ Property / cites work @@
+Adaptive constraint reduction for convex quadratic programming
+Normal rank
@@ Property / cites work @@
+Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization
+Normal rank
@@ Property / cites work @@
+A primal-dual regularized interior-point method for convex quadratic programs
+Normal rank
@@ Property / cites work @@
+An entire space polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+An unconstrained convex programming approach to solving convex quadratic programming problems
+Normal rank
@@ Property / cites work @@
+Perturbing the dual feasible region for solving convex quadratic programs
+Normal rank
@@ Property / cites work @@
+Exterior point algorithms for nearest points and convex quadratic programs
+Normal rank
@@ Property / cites work @@
+A new penalty function algorithm for convex quadratic programming
+Normal rank
@@ Property / cites work @@
+A Primal-Dual Exterior Point Method for Nonlinear Optimization
+Normal rank
@@ Property / cites work @@
+An interior-exterior approach for convex quadratic programming
+Normal rank
@@ Property / cites work @@
+A Globally and Superlinearly Convergent Algorithm for Convex Quadratic Programs with Simple Bbounds
+Normal rank
@@ Property / cites work @@
+A Finite Continuation Algorithm for Bound Constrained Quadratic Programming
+Normal rank
@@ Property / cites work @@
+An exterior Newton method for strictly convex quadratic programming
+Normal rank
@@ Property / cites work @@
+A non-interior path following method for convex quadratic programming problems with bound constraints
+Normal rank
@@ Property / cites work @@
+A numerically stable dual method for solving strictly convex quadratic programs
+Normal rank
@@ Property / cites work @@
+Q5203586
@@ Property / cites work: Q5203586 / rank @@
+Normal rank
@@ Property / cites work @@
+QPSchur: A dual, active-set, Schur-complement method for large-scale and structured convex quadratic programming
+Normal rank
@@ Property / cites work @@
+A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization
+Normal rank
@@ Property / cites work @@
+A non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem
+Normal rank
@@ Property / cites work @@
+A Globally and Locally Superlinearly Convergent Non--Interior-Point Algorithm for P<sub>0</sub>LCPs
+Normal rank
@@ Property / cites work @@
+Global convergence of a class of non-interior point algorithms using Chen-Harker-Kanzow-Smale functions for nonlinear complementarity problems
+Normal rank
@@ Property / cites work @@
+Q4252833
@@ Property / cites work: Q4252833 / rank @@
+Normal rank
@@ Property / cites work @@
+The global linear convergence of an infeasible non-interior path-following algorithm for complementarity problems with uniform \(P\)-functions
+Normal rank
@@ Property / cites work @@
+A Global Linear and Local Quadratic Noninterior Continuation Method for Nonlinear Complementarity Problems Based on Chen--Mangasarian Smoothing Functions
+Normal rank
@@ Property / cites work @@
+A global linear and local quadratic continuation smoothing method for variational inequalities with box constraints
+Normal rank
@@ Property / cites work @@
+Complexity of a noninterior path-following method for the linear complementarity problem
+Normal rank
@@ Property / cites work @@
+Robust Statistics
@@ Property / cites work: Robust Statistics / rank @@
+Normal rank
@@ Property / cites work @@
+A complexity analysis of a smoothing method using CHKS-functions for monotone linear complementarity problems
+Normal rank
@@ Property / cites work @@
+Application of a Smoothing Technique to Decomposition in Convex Optimization
+Normal rank
@@ Property / cites work @@
+Interior-point Lagrangian decomposition method for separable convex optimization
+Normal rank
@@ Property / cites work @@
+An Inexact Perturbed Path-Following Method for Lagrangian Decomposition in Large-Scale Separable Convex Optimization
+Normal rank
@@ Property / cites work @@
+Path-following gradient-based decomposition algorithms for separable convex optimization
+Normal rank
@@ Property / cites work @@
+Nonlinear rescaling vs. smoothing technique in convex optimization
+Normal rank
@@ Property / cites work @@
+Q5588268
@@ Property / cites work: Q5588268 / rank @@
+Normal rank
@@ Property / cites work @@
+A special newton-type optimization method
@@ Property / cites work: A special newton-type optimization method / rank @@
+Normal rank
@@ Property / cites work @@
+On the entropic perturbation and exponential penalty methods for linear programming
+Normal rank
@@ Property / cites work @@
+Primal and dual convergence of a proximal point exponential penalty method for linear programming
+Normal rank
@@ Property / cites work @@
+Modified barrier functions (theory and methods)
@@ Property / cites work: Modified barrier functions (theory and methods) / rank @@
+Normal rank
@@ Property / cites work @@
+On the convergence of the exponential multiplier method for convex programming
+Normal rank
@@ Property / cites work @@
+Nonlinear rescaling and proximal-like methods in convex optimization
+Normal rank
@@ Property / cites work @@
+Primal-dual nonlinear rescaling method for convex optimization
+Normal rank
@@ Property / cites work @@
+Primal–dual exterior point method for convex optimization
+Normal rank
@@ Property / cites work @@
+.5-\(Q\)-superlinear convergence of an exterior-point method for constrained optimization
+Normal rank
@@ Property / cites work @@
+Primal-dual nonlinear rescaling method with dynamic scaling parameter update
+Normal rank
@@ Property / cites work @@
+The Newton modified barrier method for QP problems
+Normal rank
@@ Property / cites work @@
+Nonlinear programming without a penalty function or a filter
+Normal rank
@@ Property / cites work @@
+Erratum to: ``Nonlinear programming without a penalty function or a filter''
+Normal rank
@@ Property / cites work @@
+A new bound for the quadratic assignment problem based on convex quadratic programming
+Normal rank
@@ Property / cites work @@
+Q2726059
@@ Property / cites work: Q2726059 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4324980
@@ Property / cites work: Q4324980 / rank @@
+Normal rank
@@ Property / cites work @@
+A Mathematical View of Interior-Point Methods in Convex Optimization
+Normal rank
@@ Property / cites work @@
+Q4821526
@@ Property / cites work: Q4821526 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3050157
@@ Property / cites work: Q3050157 / rank @@
+Normal rank
@@ Property / cites work @@
+Khachiyan’s algorithm for linear programming
@@ Property / cites work: Khachiyan’s algorithm for linear programming / rank @@
+Normal rank
@@ Property / cites work @@
+Remark on the Constraint Sets in Linear Programming
+Normal rank
@@ Property / cites work @@
+A repository of convex quadratic programming problems
+Normal rank
@@ Property / cites work @@
+Symmetric Quasidefinite Matrices
@@ Property / cites work: Symmetric Quasidefinite Matrices / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S10589-014-9710-8
@@ Property / DOI: 10.1007/S10589-014-9710-8 / rank @@
+Normal rank