On the public citation graph
First and second order analysis of nonlinear semidefinite programs
0 signed · 213 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/978-1-4615-7904-5openalex-snapshot
Stable Mappings and Their Singularities
inferredcites →https://doi.org/10.1007/bf00933349openalex-snapshot
On the existence and nonexistence of Lagrange multipliers in Banach spaces
inferredcites →https://doi.org/10.1007/bf01386087openalex-snapshot
On eigenvalues of matrices dependent on a parameter
inferredcites →https://doi.org/10.1007/bf01443623openalex-snapshot
Perturbation theory of nonlinear programs when the set of optimal solutions is not a singleton
inferredcites →https://doi.org/10.1007/bf01445166openalex-snapshot
Metric regularity, tangent sets, and second-order optimality conditions
inferredcites →https://doi.org/10.1007/bf01580754openalex-snapshot
An envelope-like effect of infinitely many inequality constraints on second-order necessary conditions for minimization problems
inferredcites →https://doi.org/10.1007/bf01582096openalex-snapshot
First and second-order necessary and sufficient optimality conditions for infinite-dimensional programming problems
inferredcites →https://doi.org/10.1007/bf01585933openalex-snapshot
Directional differentiability of the optimal value function in convex semi-infinite programming
inferredcites →https://doi.org/10.1007/bf02296274openalex-snapshot
Rank-Reducibility of a Symmetric Matrix and Sampling Theory of Minimum Trace Factor Analysis
inferredcites →https://doi.org/10.1007/bf02614432openalex-snapshot
Complementarity and nondegeneracy in semidefinite programming
inferredcites →https://doi.org/10.1007/bfb0006504openalex-snapshot
Second-order necessary and sufficient optimality conditions for infinite-dimensional programming problems
inferredcites →https://doi.org/10.1007/bfb0120988openalex-snapshot
On regularity conditions in mathematical programming
inferredcites →https://doi.org/10.1016/0024-3795(83)90092-7openalex-snapshot
On the unsolvability of inverse eigenvalues problems almost everywhere
inferredcites →https://doi.org/10.1016/0024-3795(85)90182-xopenalex-snapshot
Extremal problems on the set of nonnegative definite matrices
inferredcites →https://doi.org/10.1016/b978-1-898563-21-1.50008-0openalex-snapshot
Mathematical Programming
inferredcites →https://doi.org/10.1016/c2009-0-22048-4openalex-snapshot
Inequalities - Theory of Majorization and Its Applications
inferredcites →https://doi.org/10.1016/s0076-5392(08)x6041-2openalex-snapshot
Introduction to Sensitivity and Stability Analysis in Nonlinear Programming
inferredcites →https://doi.org/10.1070/rm1971v026n02abeh003827openalex-snapshot
ON MATRICES DEPENDING ON PARAMETERS
inferredcites →https://doi.org/10.1080/00401706.1995.10485910openalex-snapshot
Discrete Event Systems: Sensitivity Analysis and Stochastic Optimization by the Score Function Method
inferredcites →https://doi.org/10.1137/0130053openalex-snapshot
First Order Conditions for General Nonlinear Optimization
inferredcites →https://doi.org/10.1137/0326037openalex-snapshot
Sensitivity Analysis of Nonlinear Programs and Differentiability Properties of Metric Projections
inferredcites →https://doi.org/10.1137/1.9781611970524openalex-snapshot
Conjugate Duality and Optimization
inferredcites →https://doi.org/10.1137/1.9781611970524.ch1openalex-snapshot
1. Conjugate Duality and Optimization
inferredcites →https://doi.org/10.1137/1.9781611970791openalex-snapshot
Interior-Point Polynomial Algorithms in Convex Programming
inferredcites →https://doi.org/10.1137/s089547989324598xopenalex-snapshot
Second Derivatives for Optimizing Eigenvalues of Symmetric Matrices
inferredcites →https://doi.org/10.1137/s1052623495279785openalex-snapshot
On Uniqueness of Lagrange Multipliers in Optimization Problems Subject to Cone Constraints
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.2307/2287859openalex-snapshot
Inequalities: Theory of Majorization and its Applications.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4873878openalex-extracted
Dissipative State Feedback of General Linear Time-Delay Systems: Applications of the Kronecker-Seuret Decomposition Concept
inferred← citeshttps://doi.org/10.1002/rnc.3948openalex-snapshot
Sequential LMI approach for the design of a BMI‐based robust observer state feedback controller with nonlinear uncertainties
inferred← citeshttps://doi.org/10.1002/rnc.5796openalex-snapshot
A successive convex optimization method for bilinear matrix inequality problems and its application to static output‐feedback control
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_100openalex-snapshot
Duality for Semidefinite Programming
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_438openalex-snapshot
Second Order Constraint Qualifications
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_451openalex-snapshot
Semidefinite Programming: Optimality Conditions and Stability
inferred← citeshttps://doi.org/10.1007/0-387-24276-7_32openalex-snapshot
Augmented Lagrangian and Nonlinear Semidefinite Programs
inferred← citeshttps://doi.org/10.1007/3-540-61310-2_13openalex-snapshot
Cone-LP's and semidefinite programs: Geometry and a simplex-type method
inferred← citeshttps://doi.org/10.1007/978-0-387-35514-6_13openalex-snapshot
Semidefinite and Lagrangian Relaxations for Hard Combinatorial Problems
inferred← citeshttps://doi.org/10.1007/978-1-4614-0769-0_16openalex-snapshot
Elementary Optimality Conditions for Nonlinear SDPs
inferred← citeshttps://doi.org/10.1007/978-3-031-67422-8_2openalex-snapshot
−C Representing Functionals
inferred← citeshttps://doi.org/10.1007/bf02296154openalex-snapshot
The Asymptotic Bias of Minimum Trace Factor Analysis, with Applications to the Greatest Lower Bound to Reliability
inferred← citeshttps://doi.org/10.1007/bf02614432openalex-snapshot
Complementarity and nondegeneracy in semidefinite programming
inferred← citeshttps://doi.org/10.1007/jhep11(2025)003openalex-snapshot
Skydiving to bootstrap islands
inferred← citeshttps://doi.org/10.1007/pl00011370openalex-snapshot
Optimality conditions for nonconvex semidefinite programming
inferred← citeshttps://doi.org/10.1007/pl00011408openalex-snapshot
On the generic properties of convex optimization problems in conic form
inferred← citeshttps://doi.org/10.1007/s00158-014-1090-2openalex-snapshot
A feasible direction interior point algorithm for nonlinear semidefinite programming
inferred← citeshttps://doi.org/10.1007/s00158-014-1146-3openalex-snapshot
A semidefinite programming approach to robust truss topology optimization under uncertainty in locations of nodes
inferred← citeshttps://doi.org/10.1007/s00158-016-1564-5openalex-snapshot
A feasible direction algorithm for general nonlinear semidefinite programming
inferred← citeshttps://doi.org/10.1007/s00186-011-0350-9openalex-snapshot
A self-concordance property for nonconvex semidefinite programming
inferred← citeshttps://doi.org/10.1007/s00186-015-0513-1openalex-snapshot
First order solutions in conic programming
inferred← citeshttps://doi.org/10.1007/s00186-017-0579-zopenalex-snapshot
A space decomposition scheme for maximum eigenvalue functions and its applications
inferred← citeshttps://doi.org/10.1007/s00211-007-0095-9openalex-snapshot
Second-order nonsmooth optimization for H ∞ synthesis
inferred← citeshttps://doi.org/10.1007/s00220-017-2859-0openalex-snapshot
An Improved Semidefinite Programming Hierarchy for Testing Entanglement
inferred← citeshttps://doi.org/10.1007/s00245-026-10487-zopenalex-snapshot
Second-Order Optimality Conditions for Nonsmooth Constrained Optimization with Applications to Bilevel Programming
inferred← citeshttps://doi.org/10.1007/s10107-005-0613-4openalex-snapshot
Perturbation analysis of second-order cone programming problems
inferred← citeshttps://doi.org/10.1007/s10107-005-0627-yopenalex-snapshot
Error Bounds for Eigenvalue and Semidefinite Matrix Inequality Systems
inferred← citeshttps://doi.org/10.1007/s10107-005-0635-yopenalex-snapshot
Spectral bundle methods for non-convex maximum eigenvalue functions: second-order methods
inferred← citeshttps://doi.org/10.1007/s10107-006-0028-xopenalex-snapshot
Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling
inferred← citeshttps://doi.org/10.1007/s10107-010-0354-xopenalex-snapshot
Local and superlinear convergence of a primal-dual interior point method for nonlinear semidefinite programming
inferred← citeshttps://doi.org/10.1007/s10107-015-0915-0openalex-snapshot
Sufficient optimality conditions hold for almost all nonlinear semidefinite programs
inferred← citeshttps://doi.org/10.1007/s10107-016-1040-4openalex-snapshot
Optimality conditions for nonlinear semidefinite programming via squared slack variables
inferred← citeshttps://doi.org/10.1007/s10107-018-1250-zopenalex-snapshot
Statistical inference of semidefinite programming
inferred← citeshttps://doi.org/10.1007/s10107-018-1300-6openalex-snapshot
On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming
inferred← citeshttps://doi.org/10.1007/s10107-018-1354-5openalex-snapshot
Optimality conditions and global convergence for nonlinear semidefinite programming
inferred← citeshttps://doi.org/10.1007/s10107-021-01690-7openalex-snapshot
On the sensitivity of the optimal partition for parametric second-order conic optimization
inferred← citeshttps://doi.org/10.1007/s10107-022-01827-2openalex-snapshot
Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints
inferred← citeshttps://doi.org/10.1007/s10107-023-01942-8openalex-snapshot
First- and second-order optimality conditions for second-order cone and semidefinite programming under a constant rank condition
inferred← citeshttps://doi.org/10.1007/s10107-023-01970-4openalex-snapshot
Weak notions of nondegeneracy in nonlinear semidefinite programming
inferred← citeshttps://doi.org/10.1007/s10107-025-02199-zopenalex-snapshot
Finite convergence of the Moment-SOS hierarchy for polynomial matrix optimization
inferred← citeshttps://doi.org/10.1007/s10114-005-0702-6openalex-snapshot
Approximate Augmented Lagrangian Functions and Nonlinear Semidefinite Programs
inferred← citeshttps://doi.org/10.1007/s10255-003-0112-4openalex-snapshot
On First Order Optimality Conditions for Vector Optimization
inferred← citeshttps://doi.org/10.1007/s10255-020-0964-xopenalex-snapshot
A New QP-free Algorithm Without a Penalty Function or a Filter for Nonlinear Semidefinite Programming
inferred← citeshttps://doi.org/10.1007/s10255-021-1037-5openalex-snapshot
$${\cal U}{\cal V}$$-theory of a Class of Semidefinite Programming and Its Applications
inferred← citeshttps://doi.org/10.1007/s10255-022-1081-9openalex-snapshot
A Line Search SQP-type Method with Bi-object Strategy for Nonlinear Semidefinite Programming
inferred← citeshttps://doi.org/10.1007/s10589-005-3231-4openalex-snapshot
Successive Linearization Methods for Nonlinear Semidefinite Programs
inferred← citeshttps://doi.org/10.1007/s10589-006-6441-5openalex-snapshot
Calmness and Exact Penalization in Vector Optimization with Cone Constraints
inferred← citeshttps://doi.org/10.1007/s10589-013-9545-8openalex-snapshot
A homotopy method for nonlinear semidefinite programming
inferred← citeshttps://doi.org/10.1007/s10589-013-9568-1openalex-snapshot
Global convergence of modified augmented Lagrangian methods for nonlinear semidefinite programming
inferred← citeshttps://doi.org/10.1007/s10589-013-9624-xopenalex-snapshot
The space decomposition theory for a class of eigenvalue optimizations
inferred← citeshttps://doi.org/10.1007/s10589-018-0017-zopenalex-snapshot
Exact augmented Lagrangian functions for nonlinear semidefinite programming
inferred← citeshttps://doi.org/10.1007/s10589-023-00501-3openalex-snapshot
Complexity analysis of interior-point methods for second-order stationary points of nonlinear semidefinite optimization problems
inferred← citeshttps://doi.org/10.1007/s10589-024-00562-yopenalex-snapshot
Local convergence of primal–dual interior point methods for nonlinear semidefinite optimization using the Monteiro–Tsuchiya family of search directions
inferred← citeshttps://doi.org/10.1007/s10898-011-9779-xopenalex-snapshot
On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming
inferred← citeshttps://doi.org/10.1007/s10898-013-0093-7openalex-snapshot
Nonlinear separation approach for the augmented Lagrangian in nonlinear semidefinite programming
inferred← citeshttps://doi.org/10.1007/s10898-015-0276-5openalex-snapshot
A homotopy method based on penalty function for nonlinear semidefinite programming
inferred← citeshttps://doi.org/10.1007/s10898-019-00831-9openalex-snapshot
A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs
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/s10898-025-01539-9openalex-snapshot
Sparse polynomial optimization with matrix constraints
inferred← citeshttps://doi.org/10.1007/s10957-006-9055-2openalex-snapshot
Lower-Order Penalization Approach to Nonlinear Semidefinite Programming
inferred← citeshttps://doi.org/10.1007/s10957-006-9078-8openalex-snapshot
Properties of the Augmented Lagrangian in Nonlinear Semidefinite Optimization
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-010-9758-2openalex-snapshot
Equivalent Conditions for Jacobian Nonsingularity in Linear Symmetric Cone Programming
inferred← citeshttps://doi.org/10.1007/s10957-014-0634-3openalex-snapshot
On Saddle Points in Semidefinite Optimization via Separation Scheme
inferred← citeshttps://doi.org/10.1007/s10957-016-1023-xopenalex-snapshot
Exact Conic Programming Relaxations for a Class of Convex Polynomial Cone Programs
inferred← citeshttps://doi.org/10.1007/s10957-024-02401-wopenalex-snapshot
Quadratic Growth and Linear Convergence of a DCA Method for Quartic Minimization over the Sphere
inferred← citeshttps://doi.org/10.1007/s11075-026-02351-6openalex-snapshot
A reduced SQP-type algorithm for nonlinear semidefinite programming with LMI constraints
inferred← citeshttps://doi.org/10.1007/s11228-013-0237-4openalex-snapshot
On the Second-order Directional Derivatives of Singular Values of Matrices and Symmetric Matrix-valued Functions
inferred← citeshttps://doi.org/10.1007/s11228-016-0370-yopenalex-snapshot
Strong Stationarity for Optimization Problems with Complementarity Constraints in Absence of Polyhedricity
inferred← citeshttps://doi.org/10.1007/s11228-023-00666-3openalex-snapshot
Sequential Constant Rank Constraint Qualifications for Nonlinear Semidefinite Programming with Algorithmic Applications
inferred← citeshttps://doi.org/10.1007/s11228-023-00676-1openalex-snapshot
On the Weak Second-order Optimality Condition for Nonlinear Semidefinite and Second-order Cone Programming
inferred← citeshttps://doi.org/10.1007/s11228-023-00691-2openalex-snapshot
Variational Analysis of Norm Cones in Finite Dimensional Euclidean Spaces
inferred← citeshttps://doi.org/10.1007/s11425-009-0168-6openalex-snapshot
On filter-successive linearization methods for nonlinear semidefinite programming
inferred← citeshttps://doi.org/10.1007/s11590-018-1274-6openalex-snapshot
Sequential parametric convex approximation algorithm for bilinear matrix inequality problem
inferred← citeshttps://doi.org/10.1007/s11590-018-1346-7openalex-snapshot
Asymptotic behaviors of semidefinite programming with a covariance perturbation
inferred← citeshttps://doi.org/10.1007/s11590-021-01737-wopenalex-snapshot
Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming
inferred← citeshttps://doi.org/10.1007/s11590-023-02031-7openalex-snapshot
A simple proof of second-order sufficient optimality conditions in nonlinear semidefinite optimization
inferred← citeshttps://doi.org/10.1007/s40305-015-0088-9openalex-snapshot
On Some Aspects of Perturbation Analysis for Matrix Cone Optimization Induced by Spectral Norm
inferred← citeshttps://doi.org/10.1016/j.amc.2015.05.119openalex-snapshot
Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization
inferred← citeshttps://doi.org/10.1016/j.cam.2018.02.035openalex-snapshot
A note on computing the smallest conic singular value
inferred← citeshttps://doi.org/10.1016/j.cma.2009.06.018openalex-snapshot
Confidence structural robust design and optimization under stiffness and load uncertainties
inferred← citeshttps://doi.org/10.1016/j.cma.2014.10.014openalex-snapshot
Multi-scale robust design and optimization considering load uncertainties
inferred← citeshttps://doi.org/10.1016/j.fraope.2023.100014openalex-snapshot
Robust edge weight synthesis for LPV multi-agent systems with integral quadratic constraints
inferred← citeshttps://doi.org/10.1016/j.ic.2022.104965openalex-snapshot
Encoding inductive invariants as barrier certificates: Synthesis via difference-of-convex programming
inferred← citeshttps://doi.org/10.1016/j.ifacol.2018.11.089openalex-snapshot
Sequential Convex Overbounding Approximation Method for Bilinear Matrix Inequality Problems
inferred← citeshttps://doi.org/10.1016/j.ifacol.2022.09.321openalex-snapshot
Anti-windup-like Compensator Synthesis for Discrete-Time Quantized Control Systems
inferred← citeshttps://doi.org/10.1016/j.isatra.2020.10.056openalex-snapshot
Finite-frequency memory filter design for uncertain linear discrete-time systems: A polynomially parameter-dependent approach
inferred← citeshttps://doi.org/10.1016/j.jfranklin.2023.03.003openalex-snapshot
Resilient control co-design for cyber-Physical systems with DoS attacks via a successive convex optimization approach
inferred← citeshttps://doi.org/10.1016/j.nahs.2024.101530openalex-snapshot
Sampled-data feedback control design in the presence of quantized actuators
inferred← citeshttps://doi.org/10.1016/j.orl.2017.03.003openalex-snapshot
Convergent conic linear programming relaxations for cone convex polynomial programs
inferred← citeshttps://doi.org/10.1016/j.sysconle.2019.02.006openalex-snapshot
A quadratic matrix inequality based PID controller design for LPV systems
inferred← citeshttps://doi.org/10.1016/s0167-6377(03)00069-5openalex-snapshot
A sensitivity result for semidefinite programs
inferred← citeshttps://doi.org/10.1016/s0168-9274(98)00102-0openalex-snapshot
On parametric semidefinite programming
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)41197-9openalex-snapshot
A Superlinear Algorithm to Solve Generalized Eigenvalue Problems
inferred← citeshttps://doi.org/10.1023/a:1022940300114openalex-snapshot
Sensitivity Analysis of Generalized Equations
inferred← citeshttps://doi.org/10.1080/01630563.2014.895763openalex-snapshot
Optimality Conditions in Semidefinite Programming
inferred← citeshttps://doi.org/10.1080/01630563.2018.1552965openalex-snapshot
No Gap Second-Order Optimality Conditions for Circular Conic Programs
inferred← citeshttps://doi.org/10.1080/02331930290019396openalex-snapshot
THE CENTRAL PATH IN SMOOTH CONVEX SEMIDEFINITE PROGRAMS
inferred← citeshttps://doi.org/10.1080/02331930310001637404openalex-snapshot
A sequential quadratic penalty method for nonlinear semidefinite programming
inferred← citeshttps://doi.org/10.1080/02331934.2019.1671382openalex-snapshot
Parametric analysis of semidefinite optimization
inferred← citeshttps://doi.org/10.1080/02331934.2022.2103417openalex-snapshot
On continuous selections of polynomial functions
inferred← citeshttps://doi.org/10.1080/02331934.2024.2345397openalex-snapshot
A globally convergent SQP-type method with least constraint violation for nonlinear semidefinite programming
inferred← citeshttps://doi.org/10.1080/10556780701223970openalex-snapshot
Local convergence of an augmented Lagrangian method for matrix inequality constrained programming
inferred← citeshttps://doi.org/10.1080/10556788.2023.2167995openalex-snapshot
Distributionally robust expected residual minimization for stochastic variational inequality problems
inferred← citeshttps://doi.org/10.1080/23307706.2026.2664773openalex-snapshot
Sequential convex optimisation with adaptive feasible sets for fixed-order dynamic output feedback control
inferred← citeshttps://doi.org/10.1109/cdc.2005.1583339openalex-snapshot
Nondegenerate Necessary Conditions of Optimality for Problems Without Normality Assumptions
inferred← citeshttps://doi.org/10.1109/cdc.2012.6427102openalex-snapshot
An inner convex approximation algorithm for BMI optimization and applications in control
inferred← citeshttps://doi.org/10.1109/cdc.2016.7798552openalex-snapshot
A sequential parametric convex approximation method for solving bilinear matrix inequalities
inferred← citeshttps://doi.org/10.1109/cdc.2018.8619567openalex-snapshot
Convex Relaxation of Bilinear Matrix Inequalities Part I: Theoretical Results
inferred← citeshttps://doi.org/10.1109/ecc.2016.7810520openalex-snapshot
A new gradient based approach for concurrent optimal plant and controller design
inferred← citeshttps://doi.org/10.1109/icra57147.2024.10610765openalex-snapshot
Online-Learning-Based Distributionally Robust Motion Control with Collision Avoidance for Mobile Robots
inferred← citeshttps://doi.org/10.1109/tac.2011.2176154openalex-snapshot
Combining Convex–Concave Decompositions and Linearization Approaches for Solving BMIs, With Application to Static Output Feedback
inferred← citeshttps://doi.org/10.1109/tac.2024.3520835openalex-snapshot
State Estimator Design: Addressing General Delay Structures With Dissipative Constraints
inferred← citeshttps://doi.org/10.1109/tcns.2018.2873229openalex-snapshot
Time-Varying Sensor and Actuator Selection for Uncertain Cyber-Physical Systems
inferred← citeshttps://doi.org/10.1109/ticps.2025.3643827openalex-snapshot
Secure Control for Cyber-Physical Systems Under Stealthy Attacks via a Successive Convex Optimization Algorithm
inferred← citeshttps://doi.org/10.1109/tsp.2013.2281301openalex-snapshot
Robust Adaptive Beamforming for General-Rank Signal Model With Positive Semi-Definite Constraint via POTDC
inferred← citeshttps://doi.org/10.1137/050625977openalex-snapshot
Loss of Superlinear Convergence for an SQP-Type Method with Conic Constraints
inferred← citeshttps://doi.org/10.1137/070681235openalex-snapshot
Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
inferred← citeshttps://doi.org/10.1137/100786022openalex-snapshot
Minimizing the Condition Number of a Gram Matrix
inferred← citeshttps://doi.org/10.1137/15m1020770openalex-snapshot
Generic Minimizing Behavior in Semialgebraic Optimization
inferred← citeshttps://doi.org/10.1137/16m1068992openalex-snapshot
Generic Properties for Semialgebraic Programs
inferred← citeshttps://doi.org/10.1137/16m1105888openalex-snapshot
$LDL^T$ Direction Interior Point Method for Semidefinite Programming
inferred← citeshttps://doi.org/10.1137/18m1203183openalex-snapshot
A Matrix Positivstellensatz with Lifting Polynomials
inferred← citeshttps://doi.org/10.1137/19m1251461openalex-snapshot
Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty
inferred← citeshttps://doi.org/10.1137/24m1675461openalex-snapshot
On the Complexity of Matrix Putinar’s Positivstellensätz
inferred← citeshttps://doi.org/10.1137/s0036144596302644openalex-snapshot
Optimization Problems with Perturbations: A Guided Tour
inferred← citeshttps://doi.org/10.1137/s089547980036838xopenalex-snapshot
Twice Differentiable Spectral Functions
inferred← citeshttps://doi.org/10.1137/s1052623400379620openalex-snapshot
A Squared Smoothing Newton Method for Nonsmooth Matrix Equations and Its Applications in Semidefinite Optimization Problems
inferred← citeshttps://doi.org/10.1137/s1052623402413963openalex-snapshot
Partially Augmented Lagrangian Method for Matrix Inequality Constraints
inferred← citeshttps://doi.org/10.1137/s1052623402417298openalex-snapshot
A Global Algorithm for Nonlinear Semidefinite Programming
inferred← citeshttps://doi.org/10.1137/s1052623496305717openalex-snapshot
Robust Solutions to Uncertain Semidefinite Programs
inferred← citeshttps://doi.org/10.1137/s1052623496306760openalex-snapshot
Second Order Optimality Conditions Based on Parabolic Second Order Tangent Sets
inferred← citeshttps://doi.org/10.1137/s1052623496311776openalex-snapshot
The $\U$-Lagrangian of the Maximum Eigenvalue Function
inferred← citeshttps://doi.org/10.1137/s1052623497316518openalex-snapshot
Nondegeneracy and Quantitative Stability of Parameterized Optimization Problems with Multiple Solutions
inferred← citeshttps://doi.org/10.1137/s1052623497318980openalex-snapshot
A Potential Reduction Newton Method for Constrained Equations
inferred← citeshttps://doi.org/10.1137/s1052623498338606openalex-snapshot
Error Bounds for Linear Matrix Inequalities
inferred← citeshttps://doi.org/10.11606/d.45.2023.tde-26102023-171828openalex-snapshot
Condições de qualificação para otimização semidefinida
inferred← citeshttps://doi.org/10.11606/t.45.2019.tde-23032019-204322openalex-snapshot
Condições de otimalidade para otimização cônica
inferred← citeshttps://doi.org/10.11606/t.45.2022.tde-30032022-212754openalex-snapshot
Topics in nonlinear conic optimization and applications
inferred← citeshttps://doi.org/10.11606/t.45.2023.tde-27122023-192122openalex-snapshot
Constant rank-type constraint qualifications and second-order optimality conditions
inferred← citeshttps://doi.org/10.1186/s13660-017-1415-yopenalex-snapshot
A globally convergent QP-free algorithm for nonlinear semidefinite programming
inferred← citeshttps://doi.org/10.12775/tmna.2001.026openalex-snapshot
Variational and boundary value problems with perturbations
inferred← citeshttps://doi.org/10.1287/moor.1040.0115openalex-snapshot
Sensitivity Analysis of Parameterized Variational Inequalities
inferred← citeshttps://doi.org/10.1287/moor.1050.0172openalex-snapshot
Second-Order Necessary Optimality Conditions for Problems Without A Priori Normality Assumptions
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.1080.0315openalex-snapshot
Local Duality of Nonlinear Semidefinite Programming
inferred← citeshttps://doi.org/10.1287/moor.1110.0481openalex-snapshot
Generic Optimality Conditions for Semialgebraic Convex Programs
inferred← citeshttps://doi.org/10.1287/moor.1110.0498openalex-snapshot
Polynomial Matrix Inequality and Semidefinite Representation
inferred← citeshttps://doi.org/10.1287/moor.2016.0793openalex-snapshot
Genericity Results in Linear Conic Programming—A Tour d’Horizon
inferred← citeshttps://doi.org/10.1287/moor.2017.0901openalex-snapshot
Optimality Conditions for Problems over Symmetric Cones and a Simple Augmented Lagrangian Method
inferred← citeshttps://doi.org/10.1287/moor.2021.1234openalex-snapshot
On Computing the Nonlinearity Interval in Parametric Semidefinite Optimization
inferred← citeshttps://doi.org/10.1287/moor.2022.0298openalex-snapshot
Analysis of the Primal-Dual Central Path for Nonlinear Semidefinite Optimization Without the Nondegeneracy Condition
inferred← citeshttps://doi.org/10.1287/moor.23.1.39openalex-snapshot
On Two Interior-Point Mappings for Nonlinear Semidefinite Complementarity Problems
inferred← citeshttps://doi.org/10.1287/moor.23.4.806openalex-snapshot
Sensitivity Analysis of Optimization Problems Under Second Order Regular Constraints
inferred← citeshttps://doi.org/10.1287/moor.25.3.381.12216openalex-snapshot
General Interior-Point Maps and Existence of Weighted Paths for Nonlinear Semidefinite Complementarity Problems
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.1515/jaa.2009.149openalex-snapshot
A New Nonlinear Lagrangian Method for Nonconvex Semidefinite Programming
inferred← citeshttps://doi.org/10.15807/jorsj.46.22openalex-snapshot
ON THE STABILITY OF STATIONARY SOLUTIONS OF NONLINEAR POSITIVE SEMIDEFINITE PROGRAMS
inferred← citeshttps://doi.org/10.15807/jorsj.58.24openalex-snapshot
A SURVEY OF NUMERICAL METHODS FOR NONLINEAR SEMIDEFINITE PROGRAMMING
inferred← citeshttps://doi.org/10.1590/0101-7438.2014.034.03.0495openalex-snapshot
LINEAR AND NONLINEAR SEMIDEFINITE PROGRAMMING
inferred← citeshttps://doi.org/10.2298/yjor201223001lopenalex-snapshot
Saddle point criteria for semidefinite semi-infinite convex multiobjective optimization problems
inferred← citeshttps://doi.org/10.23952/jano.4.2022.1.08openalex-snapshot
Optimality and duality for semidefinite multiobjective programming problems using convexificators
inferred← citeshttps://doi.org/10.3233/jifs-169324openalex-snapshot
Distributionally robust games with an application to supply chain
inferred← citeshttps://doi.org/10.3390/fractalfract6010003openalex-snapshot
Semidefinite Multiobjective Mathematical Programming Problems with Vanishing Constraints Using Convexificators
inferred← citeshttps://doi.org/10.3390/math12203202openalex-snapshot
Constraint Qualifications and Optimality Conditions for Nonsmooth Semidefinite Multiobjective Programming Problems with Mixed Constraints Using Convexificators
inferred← citeshttps://doi.org/10.3390/math8020153openalex-snapshot
A Lifting-Penalty Method for Quadratic Programming with a Quadratic Matrix Inequality Constraint
inferred← citeshttps://doi.org/10.3934/dcdss.2019067openalex-snapshot
Environmental game modeling with uncertainties
inferred← citeshttps://doi.org/10.3934/jimo.2015.11.65openalex-snapshot
Convergence analysis of a nonlinear Lagrangian method for nonconvex semidefinite programming with subproblem inexactly solved
inferred← citeshttps://doi.org/10.3934/jimo.2016039openalex-snapshot
The bundle scheme for solving arbitrary eigenvalue optimizations
inferred← citeshttps://doi.org/10.3934/naco.2011.1.1openalex-snapshot
On methods for solving nonlinear semidefinite optimization problems
inferred← citeshttps://doi.org/10.4208/ijnam.v17.n4.p592openalex-snapshot
Superlinear Convergence of an SQP-Type Method for Nonlinear Semidefinite Programming
inferred← citeshttps://doi.org/10.48550/arxiv.1506.00575openalex-snapshot
A Riemannian low-rank method for optimization over semidefinite matrices with block-diagonal constraints
inferred← citeshttps://doi.org/10.48550/arxiv.2003.01759openalex-snapshot
A Unified Study of Necessary and Sufficient Optimality Conditions for Minimax and Chebyshev Problems with Cone Constraints
inferred← citeshttps://doi.org/10.48550/arxiv.2008.07894openalex-snapshot
Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming
inferred← citeshttps://doi.org/10.48550/arxiv.2105.14311openalex-snapshot
Synthesizing Invariant Barrier Certificates via Difference-of-Convex Programming
inferred← citeshttps://doi.org/10.48550/arxiv.2106.00775openalex-snapshot
Sequential constant rank constraint qualifications for nonlinear semidefinite programming with applications
inferred← citeshttps://doi.org/10.68381/jca06015openalex-snapshot
Graph-Convex Mappings and K-Convex Functions
inferred← citeshttps://doi.org/10.7939/r3804xw4mopenalex-snapshot
Generalized Quadratically Constrained Quadratic Programming and its Applications in Array Processing and Cooperative Communications
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.