Globally Convergent Primal-Dual Active-Set Methods with Inexact Subproblem Solves
From MaRDI portal
Publication:2832889
DOI10.1137/140993314zbMath1354.49064OpenAlexW2545770483MaRDI QIDQ2832889
Publication date: 15 November 2016
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/5760e1078a65ba181fee11c18212e25c9fce6b47
inexact Newton methodsKarush-Kuhn-Tucker optimality conditionsKrylov subspace methodsconvex quadratic optimizationprimal-dual active-set methodssemi-smooth Newton methods
Numerical mathematical programming methods (65K05) Numerical methods involving duality (49M29) Numerical optimization and variational techniques (65K10) Numerical methods based on necessary conditions (49M05) Newton-type methods (49M15)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A numerically stable dual method for solving strictly convex quadratic programs
- A mesh-independence result for semismooth Newton methods.
- Solving the minimal least squares problem subject to bounds on the variables
- QPSchur: A dual, active-set, Schur-complement method for large-scale and structured convex quadratic programming
- Algorithms for bound constrained quadratic programming problems
- A lower bound for the smallest singular value of a matrix
- On diagonal dominance arguments for bounding \(\| A^{-1}\|_\infty\)
- On standard quadratic optimization problems
- Optimal control of elliptic variational inequalities
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- Large-scale active-set box-constrained optimization method with spectral projected gradients
- Support-vector networks
- Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption
- A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization
- Interior-point solver for large-scale quadratic programming problems with bound constraints
- A Comparison of a Moreau--Yosida-Based Active Set Strategy and Interior Point Methods for Constrained Optimal Control Problems
- An Implementable Active-Set Algorithm for Computing a B-Stationary Point of a Mathematical Program with Linear Complementarity Constraints
- Obstacle Problems with Cohesion: A Hemivariational Inequality Approach and Its Efficient Numerical Solution
- Newton's method for linear complementarity problems
- A New Active Set Algorithm for Box Constrained Optimization
- Hybrid Krylov Methods for Nonlinear Systems of Equations
- A Primal-Dual Active Set Algorithm for Three-Dimensional Contact Problems with Coulomb Friction
- Inexact Newton Methods
- Solution of Sparse Indefinite Systems of Linear Equations
- Primal-Dual Strategy for Constrained Optimal Control Problems
- On the Maximization of a Concave Quadratic Function with Box Constraints
- The Primal-Dual Active Set Strategy as a Semismooth Newton Method
- An Infeasible Active Set Method for Quadratic Problems with Simple Bounds
- LOQO:an interior point code for quadratic programming
- Chaos control using least-squares support vector machines
- Semismooth Newton and Augmented Lagrangian Methods for a Simplified Friction Problem
- The Primal-Dual Active Set Method for Nonlinear Optimal Control Problems with Bilateral Constraints
- A Primal-Dual Active Set Method for Bilaterally Control Constrained Optimal Control of the Navier–Stokes Equations
- Projected Newton Methods for Optimization Problems with Simple Constraints
- Primal-Dual Active Set Strategy for a General Class of Constrained Optimal Control Problems
- Iterative Krylov Methods for Large Linear Systems
- A Primal-Dual Active Set Strategy for Optimal Boundary Control of a Nonlinear Reaction-Diffusion System
- An online active set strategy to overcome the limitations of explicit MPC
- Convergence of the Primal‐Dual Active Set Strategy for Diagonally Dominant Systems
- Efficient Algorithms for Problems with Friction
- Mesh independence and fast local convergence of a primal-dual active-set method for mixed control-state constrained elliptic control problems
- An Infeasible Primal-Dual Algorithm for Total Bounded Variation--Based Inf-Convolution-Type Image Restoration
- Convergence Properties of the Spline Fit
This page was built for publication: Globally Convergent Primal-Dual Active-Set Methods with Inexact Subproblem Solves
