Complementarity Problems Over Symmetric Cones: A Survey of Recent Developments in Several Aspects
From MaRDI portal
Publication:2802530
DOI10.1007/978-1-4614-0769-0_12zbMath1334.90180OpenAlexW2137641716MaRDI QIDQ2802530
Publication date: 26 April 2016
Published in: International Series in Operations Research & Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-0769-0_12
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Infeasible Mehrotra-type predictor–corrector algorithm for cartesian P*(κ) nonlinear complementarity problems over symmetric cones, On conic QPCCs, conic QCQPs and completely positive programs, A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones, Sparse recovery on Euclidean Jordan algebras, A new use of Douglas-Rachford splitting for identifying infeasible, unbounded, and pathological conic programs
Uses Software
Cites Work
- Analysis of Nonsmooth Symmetric-Matrix-Valued Functions with Applications to Semidefinite Complementarity Problems
- A Squared Smoothing Newton Method for Nonsmooth Matrix Equations and Its Applications in Semidefinite Optimization Problems
- A Predictor-Corrector Interior-Point Algorithm for the Semidefinite Linear Complementarity Problem Using the Alizadeh--Haeberly--Overton Search Direction
- Some Noninterior Continuation Methods for Linear Complementarity Problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems
- Quadratic Convergence of a Nonsmooth Newton-Type Method for Semidefinite Programs Without Strict Complementarity
- A Note on the Local Convergence of a Predictor-Corrector Interior-Point Algorithm for the Semidefinite Linear Complementarity Problem Based on the Alizadeh--Haeberly--Overton Search Direction
- Some P-Properties for Nonlinear Transformations on Euclidean Jordan Algebras
- Automorphism Invariance of P- and GUS-Properties of Linear Transformations on Euclidean Jordan Algebras
- Interior Point Trajectories and a Homogeneous Model for Nonlinear Complementarity Problems over Symmetric Cones
- Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
- Semismooth Matrix-Valued Functions
- An Infeasible Interior Point Method for Linear Complementarity Problems over Symmetric Cones
- Numerical Methods for Quasi‐Linear Elliptic Equations with Nonlinear Boundary Conditions
- \(Q\)-superlinear convergence of the iterates in primal-dual interior-point methods
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Monotonicity of Löwner operators and its applications to symmetric cone complementarity problems
- Corrector-predictor methods for sufficient linear complementarity problems
- On a global projection-type error bound for the linear complementarity problem
- NE/SQP: A robust algorithm for the nonlinear complementarity problem
- The bounded smooth reformulation and a trust region algorithm for semidefinite complementarity problems
- Analysis of nonsmooth vector-valued functions associated with second-order cones.
- Some P-properties for linear transformations on Euclidean Jordan algebras
- A new class of smoothing complementarity functions over symmetric cones
- A new smoothing Newton-type method for second-order cone programming problems
- Monotone functions on formally real Jordan algebras
- Clarke generalized Jacobian of the projection onto symmetric cones
- A damped Gauss-Newton method for the second-order cone complementarity problem
- Two classes of merit functions for the second-order cone complementarity problem
- The solution set structure of monotone linear complementarity problems over second-order cone
- Asymptotic behavior of helmberg-kojima-Monteiro (HKM) paths in interior-point methods for monotone semidefinite linear complementarity problems: General theory
- A one-step smoothing Newton method for second-order cone programming
- Strict semimonotonicity property of linear transformations on Euclidean Jordan algebras
- Smoothing algorithms for complementarity problems over symmetric cones
- A one-parametric class of merit functions for the second-order cone complementarity problem
- A globally convergent method based on Fischer-Burmeister operators for solving second-order cone constrained variational inequality problems
- Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem
- On the coderivative of the projection operator onto the second-order cone
- A regularization method for the second-order cone complementarity problem with the Cartesian \(P_0\)-property
- A one-parametric class of merit functions for the symmetric cone complementarity problem
- A smoothing method for second order cone complementarity problem
- Log-sigmoid nonlinear Lagrange method for nonlinear optimization problems over second-order cones
- Positive principal minor property of linear transformations on Euclidean Jordan algebras
- Sufficiency of linear transformations on Euclidean Jordan algebras
- On the analyticity of underlying HKM paths for monotone semidefinite linear complementarity problems
- Growth behavior of two classes of merit functions for symmetric cone complementarity problems
- Coercivity and strong semismoothness of the penalized Fischer-Burmeister function for the symmetric cone complementarity problem
- A smoothing Newton algorithm based on a one-parametric class of smoothing functions for linear programming over symmetric cones
- Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones
- Inexact non-interior continuation method for solving large-scale monotone SDCP
- An \(O(rL)\) infeasible interior-point algorithm for symmetric cone LCP via CHKS function
- A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
- Merit functions for semi-definite complementarity problems
- Error bounds for analytic systems and their applications
- A new approach to continuation methods for complementarity problems with uniform \(P\)-functions
- Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
- Euclidean Jordan algebras and interior-point algorithms
- Reduction of monotone linear complementarity problems over cones to linear programs over cones
- Non-interior continuation methods for solving semidefinite complementarity problems
- Non-interior continuation method for solving the monotone semidefinite complementarity problem
- Extension of primal-dual interior point algorithms to symmetric cones
- On a homogeneous algorithm for the monotone complementarity problem
- On semidefinite linear complementarity problems
- On a commutative class of search directions for linear programming over symmetric cones
- Self-scaled barrier functions on symmetric cones and their classification
- Global Lipschitzian error bounds for semidefinite complementarity problems with emphasis on NCPs
- A polynomial time interior-point path-following algorithm for LCP based on Chen-Harker-Kanzow smoothing techniques
- Complementarity functions and numerical experiments on some smoothing Newton methods for second-order-cone complementarity problems
- A class of smoothing functions for nonlinear and mixed complementarity problems
- Analysis of infeasible-interior-point paths arising with semidefinite linear complementarity problems
- A Newton-type method for positive-semidefinite linear complementarity problems
- A continuation method for monotone variational inequalities
- Smoothing methods for convex inequalities and linear complementarity problems
- A proximal gradient descent method for the extended second-order cone linear complementarity problem
- Penalized complementarity functions on symmetric cones
- Smoothing Newton algorithm for symmetric cone complementarity problems based on a one-parametric class of smoothing functions
- Extension of smoothing functions to symmetric cone complementarity problems
- New smooth C-functions for symmetric cone complementarity problems
- A descent method for a reformulation of the second-order cone complementarity problem
- Conditions for error bounds and bounded level sets of some merit functions for the second-order cone complementarity problem
- Strong semismoothness of the Fischer-Burmeister SDC and SOC complementarity functions
- Cartesian \(P\)-property and its applications to the semidefinite linear complementarity problem
- On the number of solutions to the complementarity problem and spanning properties of complementary cones
- An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
- On the coerciveness of some merit functions for complementarity problems over symmetric cones
- A Mathematical View of Interior-Point Methods in Convex Optimization
- On Two Interior-Point Mappings for Nonlinear Semidefinite Complementarity Problems
- Smoothing Functions for Second-Order-Cone Complementarity Problems
- Smoothing method for mathematical programs with symmetric cone complementarity constraints
- Superlinear Convergence of an Infeasible Predictor-Corrector Path-Following Interior Point Algorithm for a Semidefinite Linear Complementarity Problem Using the Helmberg–Kojima–Monteiro Direction
- A Continuation Method for Nonlinear Complementarity Problems over Symmetric Cones
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- A Non-Interior-Point Continuation Method for Linear Complementarity Problems
- Löwner's Operator and Spectral Functions in Euclidean Jordan Algebras
- Properties of a Class of Nonlinear Transformations Over Euclidean Jordan Algebras with Applications to Complementarity Problems
- Some geometrical aspects of semidefinite linear complementarity problems
- A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems
- Three-dimensional quasi-static frictional contact by using second-order cone linear complementarity problem
- Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
- VECTOR-VALUED IMPLICIT LAGRANGIAN FOR SYMMETRIC CONE COMPLEMENTARITY PROBLEMS
- Optimization and nonsmooth analysis
- A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
- Semismooth and Semiconvex Functions in Constrained Optimization
- A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming
- A special newton-type optimization method
- Centers of Monotone Generalized Complementarity Problems
