PAL-Hom method for QP and an application to LP
From MaRDI portal
Publication:2419548
DOI10.1007/s10589-019-00069-xzbMath1414.90224arXiv1703.05010OpenAlexW2912383702MaRDI QIDQ2419548
Publication date: 13 June 2019
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.05010
linear programmingconvex quadratic programminghomotopyaugmented Lagrangian methodproximal point method
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Smooth minimization of non-smooth functions
- Primal and dual active-set methods for convex quadratic programming
- qpOASES: a parametric active-set algorithm for~quadratic programming
- A new polynomial-time algorithm for linear programming
- Implementing proximal point methods for linear programming
- Stable reduced Hessian updates for indefinite quadratic programming
- Solution of contact problems by FETI domain decomposition with natural coarse space projections
- Methods for convex and general quadratic programming
- Analysis on a superlinearly convergent augmented Lagrangian method
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Multiplier and gradient methods
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- An Algorithm for Large-Scale Quadratic Programming
- Optimization Methods in Finance
- A New Active Set Algorithm for Box Constrained Optimization
- Nonlinear Perturbation of Linear Programs
- Iterative Solution of Linear Programs
- On the Implementation of a Primal-Dual Interior Point Method
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Solving large-scale linear programs by interior-point methods under the Matlab∗Environment†
- CUTE
- Augmented Lagrangians with Adaptive Precision Control for Quadratic Programming with Simple Bounds and Equality Constraints
- Newton's Method for Large Bound-Constrained Optimization Problems
- An online active set strategy to overcome the limitations of explicit MPC
- A method for solving nonlinear maximum‐problems depending on parameters
- A General Quadratic Programming Algorithm
- Duality-based domain decomposition with natural coarse-space for variational inequalities
