An augmented Lagrangian based semismooth Newton method for a class of bilinear programming problems
From MaRDI portal
Publication:2181561
DOI10.1007/s11766-019-3621-5zbMath1449.90298OpenAlexW2998392554MaRDI QIDQ2181561
Yan Liu, Chuan-Mei Wang, Su-xiang He
Publication date: 19 May 2020
Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11766-019-3621-5
strict complementarityaugmented Lagrangiansemismooth Newton methodconstrained bilinear programming problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Degeneracy removal in cutting plane methods for disjoint bilinear programming
- Sensitivity analysis of hyperbolic optimal control problems
- The augmented Lagrangian method for equality and inequality constraints in Hilbert spaces
- The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
- A new reformulation-linearization technique for bilinear programming problems
- A nonsmooth version of Newton's method
- Adaptive dynamic cost updating procedure for solving fixed charge network flow problems
- Multiplier and gradient methods
- The multiplier method of Hestenes and Powell applied to convex programming
- Smooth and Semismooth Newton Methods for Constrained Approximation and Estimation
- Newton's Method for B-Differentiable Equations
- Jointly Constrained Biconvex Programming
- Optimization and nonsmooth analysis
- A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
- Proximal Subgradients, Marginal Values, and Augmented Lagrangians in Nonconvex Optimization
- A cutting plane algorithm for solving bilinear programs
- Semismooth and Semiconvex Functions in Constrained Optimization
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
- Definite and Semidefinite Quadratic Forms
- Concavity cuts for disjoint bilinear programming
