Gradient projection method on the sphere, complementarity problems and copositivity
From MaRDI portal
Publication:6607017
DOI10.1007/S10898-024-01390-4MaRDI QIDQ6607017
S. Z. Németh, O. P. Ferreira, Petra Renáta Rigó, Yingchao Gao
Publication date: 17 September 2024
Published in: Journal of Global Optimization (Search for Journal in Brave)
Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Concepts and techniques of optimization on the sphere
- Second-order cone programming with warm start for elastoplastic analysis with von Mises yield criterion
- Copositive optimization -- recent developments and applications
- An improved algorithm to test copositivity
- Semidefinite complementarity reformulation for robust Nash equilibrium problems with Euclidean uncertainty sets
- Equilibrium problems involving the Lorentz cone
- The solution set structure of monotone linear complementarity problems over second-order cone
- Positive operators on the \(n\)-dimensional ice cream cone
- Role of copositivity in optimality criteria for nonconvex optimization problems
- On \(Q\) and \(R_0\) properties of a quadratic representation in linear complementarity problems over the second-order cone
- Scalar derivatives and scalar asymptotic derivatives: Properties and some applications
- A second order cone complementarity approach for the numerical solution of elastoplasticity problems
- The gradient projection method with Armijo's step size on manifolds
- Testing copositivity via mixed-integer linear programming
- A new certificate for copositivity
- Projections onto convex sets on the sphere
- Scalar and asymptotic scalar derivatives. Theory and applications
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- Algorithmic copositivity detection by simplicial partition
- An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
- Smoothing functions for second-order-cone complementarity problems
- The Linear Complementarity Problem
- Duality in nonlinear complementarity theory by using inversions and scalar derivatives
- Robust optimization with applications to game theory
- Some NP-complete problems in quadratic and nonlinear programming
- Projecting onto the Intersection of a Cone and a Sphere
- A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors
- Complementarity Problems over Locally Compact Cones
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction
- An Introduction to Optimization on Smooth Manifolds
- Gradient Projection and Conditional Gradient Methods for Constrained Nonconvex Minimization
- Intrinsic Formulation of KKT Conditions and Constraint Qualifications on Smooth Manifolds
- A Survey of the S-Lemma
- Copositivity tests based on the linear complementarity problem
- Riemannian optimization on unit sphere with \(p\)-norm and its applications
This page was built for publication: Gradient projection method on the sphere, complementarity problems and copositivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6607017)