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

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

Latest revision as of 02:15, 18 December 2024

scientific article
Language Label Description Also known as
English
An exterior point polynomial-time algorithm for convex quadratic programming
scientific article

    Statements

    An exterior point polynomial-time algorithm for convex quadratic programming (English)
    0 references
    20 April 2015
    0 references
    self-concordant function
    0 references
    polynomial-time algorithm
    0 references
    exterior point
    0 references
    path-following
    0 references
    convex quadratic programming
    0 references
    regularization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers