An inexact SQP Newton method for convex SC\(^{1}\) minimization problems
From MaRDI portal
Publication:711698
DOI10.1007/s10957-010-9654-9zbMath1197.90314OpenAlexW2085166912MaRDI QIDQ711698
Publication date: 27 October 2010
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-010-9654-9
Convex programming (90C25) Methods of quasi-Newton type (90C53) Methods of successive quadratic programming type (90C55)
Related Items
Active-set Newton methods for mathematical programs with vanishing constraints, A projected semismooth Newton method for problems of calibrating least squares covariance matrix
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Positive semidefinite matrix completions on chordal graphs and constraint nondegeneracy in semidefinite programming
- Partially finite convex programming. II: Explicit lattice models
- Solution of monotone complementarity problems with locally Lipschitzian functions
- A globally convergent Newton method for convex \(SC^ 1\) minimization problems
- A nonsmooth version of Newton's method
- Regularization of P0-Functions in Box Variational Inequality Problems
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- Löwner's Operator and Spectral Functions in Euclidean Jordan Algebras
- A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
- A Dual Optimization Approach to Inverse Quadratic Eigenvalue Problems with Partial Eigenstructure
- Calibrating Least Squares Semidefinite Programming with Equality and Inequality Constraints
- Matrix Analysis
- Optimization and nonsmooth analysis
- Convergence of the BFGS Method for $LC^1 $ Convex Constrained Optimization
- Semismooth and Semiconvex Functions in Constrained Optimization
- Numerical Optimization
- Analysis of Nonsmooth Symmetric-Matrix-Valued Functions with Applications to Semidefinite Complementarity Problems
- A Dual Approach to Semidefinite Least-Squares Problems
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Least-Squares Covariance Matrix Adjustment
- Convex Analysis
- On the basic theorem of complementarity
- Semismooth Matrix-Valued Functions
