On the public citation graph
Merit functions for semi-definite complemetarity problems
0 signed · 170 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-61310-2_13openalex-snapshot
Cone-LP's and semidefinite programs: Geometry and a simplex-type method
inferredcites →https://doi.org/10.1007/978-1-4899-0289-4_11openalex-snapshot
Merit Functions for Variational Inequality and Complementarity Problems
inferredcites →https://doi.org/10.1007/978-1-4899-0289-4_9openalex-snapshot
Inexact Newton Methods for Semismooth Equations with Applications to Variational Inequality Problems
inferredcites →https://doi.org/10.1007/978-1-4899-1358-6_7openalex-snapshot
Testing a New Class of Algorithms for Nonlinear Complementarity Problems
inferredcites →https://doi.org/10.1007/bf00121662openalex-snapshot
Unconstrained minimization approaches to nonlinear complementarity problems
inferredcites →https://doi.org/10.1007/bf00249052openalex-snapshot
A class of smoothing functions for nonlinear and mixed complementarity problems
inferredcites →https://doi.org/10.1007/bf00249054openalex-snapshot
On the resolution of monotone complementarity problems
inferredcites →https://doi.org/10.1007/bf01580617openalex-snapshot
NE/SQP: A robust algorithm for the nonlinear complementarity problem
inferredcites →https://doi.org/10.1007/bf01582210openalex-snapshot
Error bounds for analytic systems and their applications
inferredcites →https://doi.org/10.1007/bf01582565openalex-snapshot
A class of gap functions for variational inequalities
inferredcites →https://doi.org/10.1007/bf01585171openalex-snapshot
Nonlinear complementarity as unconstrained and constrained minimization
inferredcites →https://doi.org/10.1007/bf01585558openalex-snapshot
A primal—dual potential reduction method for problems involving matrix inequalities
inferredcites →https://doi.org/10.1007/bf01585696openalex-snapshot
Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
inferredcites →https://doi.org/10.1007/bf02096261openalex-snapshot
Error bounds and convergence analysis of feasible descent methods: a general approach
inferredcites →https://doi.org/10.1007/bf02189797openalex-snapshot
Equivalence of the generalized complementarity problem to differentiable unconstrained minimization
inferredcites →https://doi.org/10.1007/bf02191990openalex-snapshot
On stationary points of the implicit Lagrangian for nonlinear complementarity problems
inferredcites →https://doi.org/10.1007/bf02192026openalex-snapshot
Nonlinear complementarity as unconstrained optimization
inferredcites →https://doi.org/10.1007/bf02192160openalex-snapshot
A Newton-type method for positive-semidefinite linear complementarity problems
inferredcites →https://doi.org/10.1007/bf02192639openalex-snapshot
Growth behavior of a class of merit functions for the nonlinear complementarity problem
inferredcites →https://doi.org/10.1007/bf02592192openalex-snapshot
A semismooth equation approach to the solution of nonlinear complementarity problems
inferredcites →https://doi.org/10.1007/bf02614360openalex-snapshot
Equivalence of variational inequality problems to unconstrained minimization
inferredcites →https://doi.org/10.1007/bf02614395openalex-snapshot
A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems
inferredcites →https://doi.org/10.1007/bf02614396openalex-snapshot
Solution of monotone complementarity problems with locally Lipschitzian functions
inferredcites →https://doi.org/10.1007/springerreference_5340openalex-snapshot
Complementarity problems
inferredcites →https://doi.org/10.1016/0024-3795(90)90058-kopenalex-snapshot
Error bounds for the linear complementarity problem with a P-matrix
inferredcites →https://doi.org/10.1016/0024-3795(95)00707-5openalex-snapshot
On a global projection-type error bound for the linear complementarity problem
inferredcites →https://doi.org/10.1016/0167-6377(82)90049-9openalex-snapshot
The gap function of a convex program
inferredcites →https://doi.org/10.1016/0167-6377(92)90080-mopenalex-snapshot
On a global error bound for a class of monotone affine variational inequality problems
inferredcites →https://doi.org/10.1016/0898-1221(95)90187-6openalex-snapshot
Variational inequalities and network equilibrium problems
inferredcites →https://doi.org/10.1016/b978-0-12-775850-3.50013-3openalex-snapshot
Projections on Convex Sets in Hilbert Space and Spectral Theory: Part I. Projections on Convex Sets: Part II. Spectral Theory
inferredcites →https://doi.org/10.1016/b978-1-898563-21-1.50008-0openalex-snapshot
Mathematical Programming
inferredcites →https://doi.org/10.1023/a:1022607213765openalex-snapshot
Convexity of the Implicit Lagrangian
inferredcites →https://doi.org/10.1023/a:1022660704427openalex-snapshot
Unconstrained Optimization Reformulations of Variational Inequality Problems
inferredcites →https://doi.org/10.1023/a:1022688013571openalex-snapshot
On Unconstrained and Constrained Stationary Points of the Implicit Lagrangian
inferredcites →https://doi.org/10.1080/01630568908816335openalex-snapshot
Variational principles for variational inequalities
inferredcites →https://doi.org/10.1080/02331939208843795openalex-snapshot
A special newton-type optimization method
inferredcites →https://doi.org/10.1080/10556789408805573openalex-snapshot
Some equation-based methods for the nonlinear complementarity problem
inferredcites →https://doi.org/10.1080/10556789508805608openalex-snapshot
A Class of Netwton-Type methods for equality and ineqality constrained optimization
inferredcites →https://doi.org/10.1080/10556789508805627openalex-snapshot
On the local superlinear convergence of a Newton-type method for LCP under weak conditions
inferredcites →https://doi.org/10.1137/0131009openalex-snapshot
Equivalence of the Complementarity Problem to a System of Nonlinear Equations
inferredcites →https://doi.org/10.1137/0331064openalex-snapshot
An Interior-Point Method for Minimizing the Maximum Eigenvalue of a Linear Combination of Matrices
inferredcites →https://doi.org/10.1137/0805002openalex-snapshot
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
inferredcites →https://doi.org/10.1137/0806019openalex-snapshot
Global Convergence Properties of Some Iterative Methods for Linear Complementarity Problems
inferredcites →https://doi.org/10.1137/0806020openalex-snapshot
An Interior-Point Method for Semidefinite Programming
inferredcites →https://doi.org/10.1137/0806024openalex-snapshot
Equivalence of Complementarity Problems to Differentiable Minimization: A Unified Approach
inferredcites →https://doi.org/10.1137/1.9780898719000openalex-snapshot
The Linear Complementarity Problem
inferredcites →https://doi.org/10.1137/1.9781611970777openalex-snapshot
Linear Matrix Inequalities in System and Control Theory
inferredcites →https://doi.org/10.1137/s0363012994268655openalex-snapshot
Modified Projection-Type Methods for Monotone Variational Inequalities
inferredcites →https://doi.org/10.1137/s0363012994276494openalex-snapshot
A New Nonsmooth Equations Approach to Nonlinear Complementarity Problems
inferredcites →https://doi.org/10.1137/s0363012994277645openalex-snapshot
Equivalent Unconstrained Minimization and Global Error Bounds for Variational Inequality Problems
inferredcites →https://doi.org/10.1137/s1052623494269035openalex-snapshot
Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
inferredcites →https://doi.org/10.1137/s1052623494279110openalex-snapshot
A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
inferredcites →https://doi.org/10.1137/s1052623495290209openalex-snapshot
Primal-Dual Interior-Point Methods for Self-Scaled Cones
inferredcites →https://doi.org/10.1137/s1052623495294955openalex-snapshot
A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming
inferredcites →https://doi.org/10.1137/s1052623496304700openalex-snapshot
Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
inferredcites →https://doi.org/10.1142/2752openalex-snapshot
Recent Advances in Nonsmooth Optimization
inferredcites →https://doi.org/10.1142/9789812812827_0006openalex-snapshot
An NCP–Function and its Use for the Solution of Complementarity Problems
inferredcites →https://doi.org/10.1145/227683.227684openalex-snapshot
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
inferredcites →https://doi.org/10.1287/moor.12.3.474openalex-snapshot
A Posteriori Error Bounds for the Linearly-Constrained Variational Inequality Problem
inferredcites →https://doi.org/10.1287/moor.19.4.880openalex-snapshot
New Error Bounds for the Linear Complementarity Problem
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4614-0769-0_12openalex-snapshot
Complementarity Problems Over Symmetric Cones: A Survey of Recent Developments in Several Aspects
inferred← citeshttps://doi.org/10.1007/978-1-4757-6388-1_21openalex-snapshot
A New Merit Function and a Descent Method for Semidefinite Complementarity Problems
inferred← citeshttps://doi.org/10.1007/978-3-032-06924-5_3openalex-snapshot
General Complementarity Functions
inferred← citeshttps://doi.org/10.1007/s00186-006-0098-9openalex-snapshot
Two classes of merit functions for the second-order cone complementarity problem
inferred← citeshttps://doi.org/10.1007/s00186-010-0323-4openalex-snapshot
A Perturbation approach for an inverse quadratic programming problem
inferred← citeshttps://doi.org/10.1007/s00245-003-0765-7openalex-snapshot
Non-Interior Continuation Method for Solving the Monotone Semidefinite Complementarity Problem
inferred← citeshttps://doi.org/10.1007/s10107-002-0306-1openalex-snapshot
Non-Interior continuation methods for solving semidefinite complementarity problems
inferred← citeshttps://doi.org/10.1007/s10107-004-0538-3openalex-snapshot
Analysis of nonsmooth vector-valued functions associated with second-order cones
inferred← citeshttps://doi.org/10.1007/s10107-005-0601-8openalex-snapshot
Cartesian P-property and Its Applications to the Semidefinite Linear Complementarity Problem
inferred← citeshttps://doi.org/10.1007/s10107-005-0617-0openalex-snapshot
An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
inferred← citeshttps://doi.org/10.1007/s10107-005-0697-xopenalex-snapshot
A note on the Lipschitz continuity of the gradient of the squared norm of the matrix-valued Fischer-Burmeister function
inferred← citeshttps://doi.org/10.1007/s10107-007-0105-9openalex-snapshot
The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
inferred← citeshttps://doi.org/10.1007/s10107-010-0432-0openalex-snapshot
Monotonicity of Löwner operators and its applications to symmetric cone complementarity problems
inferred← citeshttps://doi.org/10.1007/s10107-012-0619-7openalex-snapshot
An introduction to a class of matrix cone programming
inferred← citeshttps://doi.org/10.1007/s10589-008-9180-yopenalex-snapshot
Smoothing algorithms for complementarity problems over symmetric cones
inferred← citeshttps://doi.org/10.1007/s10589-012-9514-7openalex-snapshot
A trust region method for solving semidefinite programs
inferred← citeshttps://doi.org/10.1007/s10589-015-9781-1openalex-snapshot
Constructions of complementarity functions and merit functions for circular cone complementarity problem
inferred← citeshttps://doi.org/10.1007/s10589-016-9889-yopenalex-snapshot
On merit functions for p-order cone complementarity problem
inferred← citeshttps://doi.org/10.1007/s10898-008-9373-zopenalex-snapshot
Some characterizations for SOC-monotone and SOC-convex functions
inferred← citeshttps://doi.org/10.1007/s10898-019-00845-3openalex-snapshot
The decompositions with respect to two core non-symmetric cones
inferred← citeshttps://doi.org/10.1007/s10957-007-9270-5openalex-snapshot
Equivalence of Two Nondegeneracy Conditions for Semidefinite Programs
inferred← citeshttps://doi.org/10.1007/s10957-007-9279-9openalex-snapshot
Conditions for Error Bounds and Bounded Level Sets of Some Merit Functions for the Second-Order Cone Complementarity Problem
inferred← citeshttps://doi.org/10.1007/s10957-009-9516-5openalex-snapshot
Coercivity and Strong Semismoothness of the Penalized Fischer-Burmeister Function for the Symmetric Cone Complementarity Problem
inferred← citeshttps://doi.org/10.1007/s10957-011-9962-8openalex-snapshot
Differential Properties of the Symmetric Matrix-Valued Fischer-Burmeister Function
inferred← citeshttps://doi.org/10.1007/s10957-013-0477-3openalex-snapshot
A New Approximation of the Matrix Rank Function and Its Application to Matrix Rank Minimization
inferred← citeshttps://doi.org/10.1007/s11075-012-9567-9openalex-snapshot
Nonsingularity of FB system and constraint nondegeneracy in semidefinite programming
inferred← citeshttps://doi.org/10.1007/s11075-015-0093-4openalex-snapshot
An inexact non-interior continuation method for semidefinite programming: convergence analysis and numerical results
inferred← citeshttps://doi.org/10.1007/s11075-020-00888-8openalex-snapshot
Convergence analysis on matrix splitting iteration algorithm for semidefinite linear complementarity problems
inferred← citeshttps://doi.org/10.1007/s11590-010-0257-zopenalex-snapshot
The same growth of FB and NR symmetric cone complementarity functions
inferred← citeshttps://doi.org/10.1007/s11590-011-0337-8openalex-snapshot
Inexact non-interior continuation method for monotone semidefinite complementarity problems
inferred← citeshttps://doi.org/10.1007/s11590-012-0569-2openalex-snapshot
A sufficient condition that has no exceptional family of elements for SDCP
inferred← citeshttps://doi.org/10.1007/s12190-015-0920-8openalex-snapshot
Douglas–Rachford splitting method for semidefinite programming
inferred← citeshttps://doi.org/10.1007/s12190-017-1128-xopenalex-snapshot
An infeasible interior point method for the monotone SDLCP based on a transformation of the central path
inferred← citeshttps://doi.org/10.1007/s41980-022-00725-9openalex-snapshot
A New Smooth NCP Function for Solving Semidefinite Nonlinear Complementarity Problems
inferred← citeshttps://doi.org/10.1016/j.amc.2003.10.040openalex-snapshot
The bounded smooth reformulation and a trust region algorithm for semidefinite complementarity problems
inferred← citeshttps://doi.org/10.1016/j.amc.2004.03.005openalex-snapshot
Global Lipschitzian error bounds for semidefinite complementarity problems with emphasis on NCPs
inferred← citeshttps://doi.org/10.1016/j.amc.2007.03.014openalex-snapshot
A globally convergent Levenberg–Marquardt method for solving nonlinear complementarity problem
inferred← citeshttps://doi.org/10.1016/j.amc.2007.05.052openalex-snapshot
Solvability of semidefinite complementarity problems
inferred← citeshttps://doi.org/10.1016/j.amc.2007.07.060openalex-snapshot
The quadratic convergence of a smoothing Levenberg–Marquardt method for nonlinear complementarity problem
inferred← citeshttps://doi.org/10.1016/j.amc.2008.08.039openalex-snapshot
A globally convergent Levenberg–Marquardt method for the least -norm solution of nonlinear inequalities
inferred← citeshttps://doi.org/10.1016/j.amc.2009.08.059openalex-snapshot
Inexact non-interior continuation method for solving large-scale monotone SDCP
inferred← citeshttps://doi.org/10.1016/j.cam.2005.07.002openalex-snapshot
Solving semidefinite programming problems via alternating direction methods
inferred← citeshttps://doi.org/10.1016/j.cam.2018.01.023openalex-snapshot
A novel neural network model for solving a class of nonlinear semidefinite programming problems
inferred← citeshttps://doi.org/10.1016/j.cam.2018.10.025openalex-snapshot
A novel neural network for solving semidefinite programming problems with some applications
inferred← citeshttps://doi.org/10.1016/j.cam.2020.113073openalex-snapshot
Solvability of implicit semidefinite and implicit copositive complementarity problems
inferred← citeshttps://doi.org/10.1016/j.cam.2026.118176openalex-snapshot
A smoothing gradient method for semidefinite programs
inferred← citeshttps://doi.org/10.1016/j.camwa.2009.07.084openalex-snapshot
A globally convergent method based on Fischer–Burmeister operators for solving second-order cone constrained variational inequality problems
inferred← citeshttps://doi.org/10.1016/j.jmaa.2007.03.003openalex-snapshot
On the coerciveness of some merit functions for complementarity problems over symmetric cones
inferred← citeshttps://doi.org/10.1016/j.jmaa.2009.01.064openalex-snapshot
A one-parametric class of merit functions for the symmetric cone complementarity problem
inferred← citeshttps://doi.org/10.1016/j.jmaa.2010.01.011openalex-snapshot
A proximal gradient descent method for the extended second-order cone linear complementarity problem
inferred← citeshttps://doi.org/10.1016/j.jmaa.2011.10.028openalex-snapshot
Exceptional family and solvability of copositive complementarity problems
inferred← citeshttps://doi.org/10.1016/j.laa.2004.03.028openalex-snapshot
Some P-properties for linear transformations on Euclidean Jordan algebras
inferred← citeshttps://doi.org/10.1016/j.na.2007.05.003openalex-snapshot
Analysis of symmetric matrix valued functions I
inferred← citeshttps://doi.org/10.1016/j.na.2008.02.028openalex-snapshot
A regularization method for the second-order cone complementarity problem with the Cartesian -property
inferred← citeshttps://doi.org/10.1016/j.na.2013.01.017openalex-snapshot
Smooth and nonsmooth analyses of vector-valued functions associated with circular cones
inferred← citeshttps://doi.org/10.1016/j.nonrwa.2008.03.013openalex-snapshot
The convergence of a smoothing damped Gauss–Newton method for nonlinear complementarity problem
inferred← citeshttps://doi.org/10.1016/j.orl.2007.08.005openalex-snapshot
The SC1 property of the squared norm of the SOC Fischer–Burmeister function
inferred← citeshttps://doi.org/10.1016/j.orl.2010.07.011openalex-snapshot
Stationary point conditions for the FB merit function associated with symmetric cones
inferred← citeshttps://doi.org/10.1016/j.orl.2016.03.004openalex-snapshot
Low-order penalty equations for semidefinite linear complementarity problems
inferred← citeshttps://doi.org/10.1016/s0024-3795(03)00425-7openalex-snapshot
On some interconnections between strict monotonicity, globally uniquely solvable, and P properties in semidefinite linear complementarity problems
inferred← citeshttps://doi.org/10.1016/s0252-9602(07)60023-xopenalex-snapshot
A global linear and local quadratic single—step noninterior continuation method for monotone semidefinite complementarity problems
inferred← citeshttps://doi.org/10.1017/s0004972708001214openalex-snapshot
PREDICTOR–CORRECTOR SMOOTHING NEWTON METHOD FOR SOLVING SEMIDEFINITE PROGRAMMING
inferred← citeshttps://doi.org/10.1023/a:1026598214921openalex-snapshot
Merit Functions for Complementarity and Related Problems: A Survey
inferred← citeshttps://doi.org/10.1023/b:jota.0000041737.19689.4copenalex-snapshot
Technical Note: Some Structural Properties of a Newton-Type Method for Semidefinite Programs
inferred← citeshttps://doi.org/10.1080/01630560701380999openalex-snapshot
Analysis of Symmetric Matrix Valued Functions
inferred← citeshttps://doi.org/10.1080/01630563.2010.485334openalex-snapshot
Two Classes of Merit Functions for Infinite-Dimensional Second Order Complimentary Problems
inferred← citeshttps://doi.org/10.1080/01630563.2011.563893openalex-snapshot
On the Lorentz Cone Complementarity Problems in Infinite-Dimensional Real Hilbert Space
inferred← citeshttps://doi.org/10.1080/02331930600819514openalex-snapshot
The convex and monotone functions associated with second-order cone
inferred← citeshttps://doi.org/10.1080/02331930802180319openalex-snapshot
Lipschitz continuity of the gradient of a one-parametric class of SOC merit functions
inferred← citeshttps://doi.org/10.1080/02331934.2011.611884openalex-snapshot
Three classes of merit functions for the complementarity problem over a closed convex cone
inferred← citeshttps://doi.org/10.1080/02331934.2016.1220553openalex-snapshot
Further relationship between second-order cone and positive semidefinite matrix cone
inferred← citeshttps://doi.org/10.1080/0954898x.2022.2104463openalex-snapshot
A smoothing gradient-based neural network strategy for solving semidefinite programming problems
inferred← citeshttps://doi.org/10.1090/s0025-5718-2013-02742-1openalex-snapshot
On the generalized Fischer-Burmeister merit function for the second-order cone complementarity problem
inferred← citeshttps://doi.org/10.1093/imanum/drp031openalex-snapshot
An augmented Lagrangian dual approach for the H-weighted nearest correlation matrix problem
inferred← citeshttps://doi.org/10.1109/bcgin.2011.180openalex-snapshot
Projection and Contraction Methods for Solving Symmetric Cone Variational Inequalities
inferred← citeshttps://doi.org/10.1109/gcis.2009.215openalex-snapshot
A Constraint Function Method for Solving Multiobjective Optimization Problems
inferred← citeshttps://doi.org/10.1109/icpr.2018.8545862openalex-snapshot
Structured Convex Optimization Method for Orthogonal Nonnegative Matrix Factorization
inferred← citeshttps://doi.org/10.1137/050624509openalex-snapshot
A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
inferred← citeshttps://doi.org/10.1137/060656346openalex-snapshot
A Dual Optimization Approach to Inverse Quadratic Eigenvalue Problems with Partial Eigenstructure
inferred← citeshttps://doi.org/10.1137/070681235openalex-snapshot
Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
inferred← citeshttps://doi.org/10.1137/090755321openalex-snapshot
A Continuation Method for Nonlinear Complementarity Problems over Symmetric Cones
inferred← citeshttps://doi.org/10.1137/12087565xopenalex-snapshot
A Barrier-Based Smoothing Proximal Point Algorithm for NCPs over Closed Convex Cones
inferred← citeshttps://doi.org/10.1137/19m1294708openalex-snapshot
Orthogonal Nonnegative Tucker Decomposition
inferred← citeshttps://doi.org/10.1137/s0895479800377927openalex-snapshot
Some New Results for the Semidefinite Linear Complementarity Problem
inferred← citeshttps://doi.org/10.1137/s0895479802417921openalex-snapshot
Semismoothness of Spectral Functions
inferred← citeshttps://doi.org/10.1137/s1052623400380365openalex-snapshot
Smoothing Functions for Second-Order-Cone Complementarity Problems
inferred← citeshttps://doi.org/10.1137/s1052623400380584openalex-snapshot
Analysis of Nonsmooth Symmetric-Matrix-Valued Functions with Applications to Semidefinite Complementarity Problems
inferred← citeshttps://doi.org/10.1137/s1052623401390525openalex-snapshot
Semidefinite Programs: New Search Directions, Smoothing-Type Methods, and Numerical Results
inferred← citeshttps://doi.org/10.1137/s1052623403431147openalex-snapshot
Quadratic Convergence of a Nonsmooth Newton-Type Method for Semidefinite Programs Without Strict Complementarity
inferred← citeshttps://doi.org/10.1137/s1052623499357945openalex-snapshot
Convergent Infeasible Interior-Point Trust-Region Methods for Constrained Minimization
inferred← citeshttps://doi.org/10.1142/s0217595906000991openalex-snapshot
SOME PROPERTIES OF A CLASS OF MERIT FUNCTIONS FOR SYMMETRIC CONE COMPLEMENTARITY PROBLEMS
inferred← citeshttps://doi.org/10.1142/s0217595909002171openalex-snapshot
VECTOR-VALUED IMPLICIT LAGRANGIAN FOR SYMMETRIC CONE COMPLEMENTARITY PROBLEMS
inferred← citeshttps://doi.org/10.1155/2012/130682openalex-snapshot
Lipschitz Continuity of the Solution Mapping of Symmetric ConeComplementarity Problems
inferred← citeshttps://doi.org/10.1155/2012/819607openalex-snapshot
A Globally Convergent Filter‐Type Trust Region Method for Semidefinite Programming
inferred← citeshttps://doi.org/10.1155/2014/589731openalex-snapshot
A Continuous Trust-Region-Type Method for Solving Nonlinear Semidefinite Complementarity Problem
inferred← citeshttps://doi.org/10.11948/2025-0277openalex-snapshot
THE PROJECTION NEURAL NETWORK METHOD AND THE EULER METHOD FOR SOLVING THE SDLCP
inferred← citeshttps://doi.org/10.1201/b10839-13openalex-snapshot
Numerical Analysis of Cable Networks
inferred← citeshttps://doi.org/10.12677/aam.2017.69147openalex-snapshot
Smooth Newton Method Based on a New NCP Function for Solving Variational Inequality Problems
inferred← citeshttps://doi.org/10.12677/csa.2025.1510263openalex-snapshot
A Projection Neural Network Method for Solving Semidefinite Programming Problems
inferred← citeshttps://doi.org/10.1287/moor.1060.0195openalex-snapshot
The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
inferred← citeshttps://doi.org/10.1287/moor.27.1.150.342openalex-snapshot
Semismooth Matrix-Valued Functions
inferred← citeshttps://doi.org/10.1287/moor.28.1.39.14258openalex-snapshot
Semismooth Homeomorphisms and Strong Stability of Semidefinite and Lorentz Complementarity Problems
inferred← citeshttps://doi.org/10.14317/jami.2013.795openalex-snapshot
MERIT FUNCTIONS FOR MATRIX CONE COMPLEMENTARITY PROBLEMS
inferred← citeshttps://doi.org/10.3934/naco.2011.1.1openalex-snapshot
On methods for solving nonlinear semidefinite optimization problems
inferred← citeshttps://doi.org/10.4236/jamp.2018.61012openalex-snapshot
Some Properties of Solution to Semidefinite Complementarity Problem
inferred← citeshttps://doi.org/10.4236/jamp.2022.104071openalex-snapshot
A Modified Newton Method Based on the Metric Projector for Solving SOCCVI Problem
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.