Trajectory-following methods for large-scale degenerate convex quadratic programming
From MaRDI portal
Publication:2392932
Recommendations
- scientific article; zbMATH DE number 589245
- Long-step path-following algorithm for convex quadratic programming problems in a Hilbert space
- An inexact perturbed path-following method for Lagrangian decomposition in large-scale separable convex optimization
- Semidefinite Programming: A Path-Following Algorithm for a Linear–Quadratic Functional
- Sequential quadratic programming for large-scale nonlinear optimization
- A non-interior path following method for convex quadratic programming problems with bound constraints
- An inexact primal-dual path following algorithm for convex quadratic SDP
- Sequential quadratic programming methods for large-scale problems
- scientific article; zbMATH DE number 1341943
- A new primal-dual path-following method for convex quadratic programming
Cites work
- scientific article; zbMATH DE number 88933 (Why is no real title available?)
- scientific article; zbMATH DE number 193018 (Why is no real title available?)
- scientific article; zbMATH DE number 4126998 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- A Superlinearly Convergent Infeasible-Interior-Point Algorithm for Geometrical LCPs Without a Strictly Complementary Condition
- A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
- A repository of convex quadratic programming problems
- A second derivative SQP method: global convergence
- A second derivative SQP method: local convergence and practical issues
- A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with \(O(\sqrt nL)\)-iteration complexity
- Benchmarking optimization software with performance profiles.
- Calculation of Zeros of a Real Polynomial Through Factorization Using Euclid’s Algorithm
- Computational experience with a primal-dual interior point method for linear programming
- Convergence of an Infeasible Interior-Point Algorithm from Arbitrary Positive Starting Points
- Corrector‐Predictor Methods for Sufficient Linear Complementarity Problems in a Wide Neighborhood of the Central Path
- Equivaence between different formulations of the linear complementarity promblem
- Further development of multiple centrality correctors for interior point methods
- GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
- High order infeasible-interior-point methods for solving sufficient linear complementarity problems
- High order long-step methods for solving linear complementarity problems
- Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity
- Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems
- Limiting Behavior of the Derivatives of Certain Trajectories Associated with a Monotone Horizontal Linear Complementarity Problem
- Logarithmic SUMT limits in convex programming
- Multiple centrality corrections in a primal-dual method for linear programming
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- On a class of superlinearly convergent polynomial time interior point methods for sufficient LCP
- On fast factorization pivoting methods for sparse symmetric indefinite systems
- On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- On the Implementation of a Primal-Dual Interior Point Method
- On the analyticity properties of infeasible-interior point paths for monotone linear complementarity problems
- On the rate of local convergence of high-order-infeasible-path-following algorithms for \(P_*\)-linear complementarity problems
- On well definedness of the central path
- Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence
- Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path
- Preprocessing for quadratic programming
- Primal-Dual Affine Scaling Interior Point Methods for Linear Complementarity Problems
- Properties of the Log-Barrier Function on Degenerate Nonlinear Programs
- Superlinear convergence of an algorithm for monotone linear complementarity problems, when no strictly complementary solution exists
- Superlinearly convergent infeasible-interior-point algorithm for degenerate LCP
- The complexity of high-order predictor-corrector methods for solving sufficient linear complementarity problems
- The design of MA48
- Trust Region Methods
- \(P_ *\)-matrices are just sufficient
Cited in
(4)- A primal-dual interior-point method based on various selections of displacement step for symmetric optimization
- An interior-point trust-funnel algorithm for nonlinear optimization
- QPLIB: a library of quadratic programming instances
- A classification of slow convergence near parametric periodic points of discrete dynamical systems
This page was built for publication: Trajectory-following methods for large-scale degenerate convex quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392932)
