The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
From MaRDI portal
Publication:5388008
DOI10.1287/moor.1060.0195zbMath1278.90304OpenAlexW2158604542MaRDI QIDQ5388008
Publication date: 27 May 2008
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/2143fb14738af1aede2ea8b35571cb5c984af6a4
strong regularitynonlinear semidefinite programmingconstraint nondegeneracystrong second-order sufficient condition
Related Items
A penalty method for generalized Nash equilibrium problems, Variational analysis of the Ky Fan \(k\)-norm, A stochastic approximation method for convex programming with many semidefinite constraints, A line search SQP-type method with bi-object strategy for nonlinear semidefinite programming, On how to solve large-scale log-determinant optimization problems, Clarke generalized Jacobian of the projection onto symmetric cones, Correlation stress testing for value-at-risk: an unconstrained convex optimization approach, A convex quadratic semi-definite programming approach to the partial additive constant problem in multidimensional scaling, Global convergence of modified augmented Lagrangian methods for nonlinear semidefinite programming, Nonsingularity in matrix conic optimization induced by spectral norm via a smoothing metric projector, Properties associated with the epigraph of the \(l_1\) norm function of projection onto the nonnegative orthant, Certifying the global optimality of quartic minimization over the sphere, Augmented Lagrangian methods for convex matrix optimization problems, Aubin property and uniqueness of solutions in cone constrained optimization, An SQP-type Method with Superlinear Convergence for Nonlinear Semidefinite Programming, On Efficiently Solving the Subproblems of a Level-Set Method for Fused Lasso Problems, Asymptotic analysis for a stochastic semidefinite programming, A perturbation approach for an inverse quadratic programming problem, Approximation of rank function and its application to the nearest low-rank correlation matrix, An augmented Lagrangian based semismooth Newton method for a class of bilinear programming problems, Spectral operators of matrices, On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming, On some aspects of perturbation analysis for matrix cone optimization induced by spectral norm, An augmented Lagrangian dual optimization approach to the \(H\)-weighted model updating problem, Quadratic Growth Conditions for Convex Matrix Optimization Problems Associated with Spectral Functions, Complexity analysis of interior-point methods for second-order stationary points of nonlinear semidefinite optimization problems, A facial reduction approach for the single source localization problem, Strong Variational Sufficiency for Nonlinear Semidefinite Programming and Its Implications, Newton's method for computing the nearest correlation matrix with a simple upper bound, Variational analysis of norm cones in finite dimensional Euclidean spaces, On the weak second-order optimality condition for nonlinear semidefinite and second-order cone programming, Nonsingularity of FB system and constraint nondegeneracy in semidefinite programming, Characterization of the Robust Isolated Calmness for a Class of Conic Programming Problems, Weak notions of nondegeneracy in nonlinear semidefinite programming, An equivalency condition of nonsingularity in nonlinear semidefinite programming, Differentiating Nonsmooth Solutions to Parametric Monotone Inclusion Problems, Sparse precision matrix estimation with missing observations, On the upper Lipschitz property of the KKT mapping for nonlinear semidefinite optimization, Perturbation analysis of the Euclidean distance matrix optimization problem and its numerical implications, Statistical Inference of Second-Order Cone Programming, Local convergence analysis of augmented Lagrangian method for nonlinear semidefinite programming, Local and superlinear convergence of a primal-dual interior point method for nonlinear semidefinite programming, A Proximal Point Dual Newton Algorithm for Solving Group Graphical Lasso Problems, A regularized strong duality for nonsymmetric semidefinite least squares problem, On duality theory for non-convex semidefinite programming, Mathematical programs with semidefinite cone complementarity constraints: constraint qualifications and optimality conditions, Strong semismoothness of projection onto slices of second-order cone, Unnamed Item, Jacobian nonsingularity in nonlinear symmetric conic programming problems and its application, First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints, Convergence analysis on matrix splitting iteration algorithm for semidefinite linear complementarity problems, On the characterizations of solutions to perturbed l1 conic optimization problem, The geometric properties of a class of nonsymmetric cones, The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming, A nonsmooth Newton method for the design of state feedback stabilizers under structure constraints, A filter method for nonlinear semidefinite programming with global convergence, A new approximation of the matrix rank function and its application to matrix rank minimization, Nonnegative inverse eigenvalue problems with partial eigendata, On the semismoothness of projection mappings and maximum eigenvalue functions, A note on convergence analysis of an SQP-type method for nonlinear semidefinite programming, Variational geometry of the complementarity set for second order cone, Inverse quadratic programming problem with \(l_1\) norm measure, Nonlinear rescaling Lagrangians for nonconvex semidefinite programming, Equivalent conditions for Jacobian nonsingularity in linear symmetric cone programming, Lipschitz continuity of the solution mapping of symmetric cone complementarity problems, Preprocessing and Regularization for Degenerate Semidefinite Programs, Nonsingularity in second-order cone programming via the smoothing metric projector, On cone of nonsymmetric positive semidefinite matrices, A projected semismooth Newton method for problems of calibrating least squares covariance matrix, Low-order penalty equations for semidefinite linear complementarity problems, A sensitivity result for quadratic second-order cone programming and its application., A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions, Positive semidefinite matrix completions on chordal graphs and constraint nondegeneracy in semidefinite programming, An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems, On the superlinear local convergence of a penalty-free method for nonlinear semidefinite programming, Nonlinear separation approach for the augmented Lagrangian in nonlinear semidefinite programming, Spectral Operators of Matrices: Semismoothness and Characterizations of the Generalized Jacobian, The decompositions with respect to two core non-symmetric cones, The rate of convergence of proximal method of multipliers for nonlinear semidefinite programming, A superlinearly convergent SSDP algorithm for nonlinear semidefinite programming, Further relationship between second-order cone and positive semidefinite matrix cone, A New Nonlinear Lagrangian Method for Nonconvex Semidefinite Programming, Properties of equation reformulation of the Karush-Kuhn-Tucker condition for nonlinear second order cone optimization problems, A perturbation approach for an inverse quadratic programming problem over second-order cones, Computation of graphical derivatives of normal cone maps to a class of conic constraint sets, Full Stability in Finite-Dimensional Optimization, Perturbation analysis of nonlinear semidefinite programming under Jacobian uniqueness conditions, On filter-successive linearization methods for nonlinear semidefinite programming, Unified convergence analysis of a second-order method of multipliers for nonlinear conic programming, A Convex Matrix Optimization for the Additive Constant Problem in Multidimensional Scaling with Application to Locally Linear Embedding, Unnamed Item, Constrained Best Euclidean Distance Embedding on a Sphere: A Matrix Optimization Approach, On properties of the bilinear penalty function method for mathematical programs with semidefinite cone complementarity constraints, On saddle points in semidefinite optimization via separation scheme, The Rate of Convergence of a NLM Based on F–B NCP for Constrained Optimization Problems Without Strict Complementarity, On Degenerate Doubly Nonnegative Projection Problems, Optimality Conditions in Semidefinite Programming
