On the public citation graph

Solving semidefinite-quadratic-linear programs using SDPT3

https://doi.org/10.1007/s10107-002-0347-5
0 signed · 1094 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4757-2878-1_11openalex-snapshot
On Primal—Dual Path—Following Algorithms for Semidefinite Programming
inferredcites →https://doi.org/10.1007/s10107-002-0355-5openalex-snapshot
An independent benchmarking of SDP and SOCP solvers
inferredcites →https://doi.org/10.1023/a:1013777203597openalex-snapshot
A Note on the Calculation of Step-Lengths in Interior-Point Methods for Semidefinite Programming
inferredcites →https://doi.org/10.1080/10556789808805691openalex-snapshot
On homogeneous interrior-point algorithms for semidefinite programming
inferredcites →https://doi.org/10.1080/10556789808805699openalex-snapshot
Solving large-scale linear programs by interior-point methods under the Matlab ∗ Environment †
inferredcites →https://doi.org/10.1080/10556789908805750openalex-snapshot
A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming
inferredcites →https://doi.org/10.1080/10556789908805762openalex-snapshot
SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
inferredcites →https://doi.org/10.1080/10556789908805765openalex-snapshot
CSDP, A C library for semidefinite programming
inferredcites →https://doi.org/10.1080/10556789908805766openalex-snapshot
Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
inferredcites →https://doi.org/10.1080/10556789908805769openalex-snapshot
SDPLIB 1.2, a library of semidefinite programming test problems
inferredcites →https://doi.org/10.1137/0802028openalex-snapshot
On the Implementation of a Primal-Dual Interior Point Method
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/0806020openalex-snapshot
An Interior-Point Method for Semidefinite Programming
inferredcites →https://doi.org/10.1137/0914063openalex-snapshot
Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers
inferredcites →https://doi.org/10.1137/1.9780898718027openalex-snapshot
Accuracy and Stability of Numerical Algorithms
inferredcites →https://doi.org/10.1137/1038003openalex-snapshot
Semidefinite Programming
inferredcites →https://doi.org/10.1137/s1052623495293056openalex-snapshot
Primal--Dual Path-Following Algorithms for Semidefinite Programming
inferredcites →https://doi.org/10.1137/s105262349630060xopenalex-snapshot
On the Nesterov--Todd Direction in 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.1137/s1052623498335067openalex-snapshot
Some New Search Directions for Primal-Dual Interior Point Methods in Semidefinite Programming
inferredcites →https://doi.org/10.1287/moor.22.1.1openalex-snapshot
Self-Scaled Barriers and Interior-Point Methods for Convex Programming
inferredcites →https://doi.org/10.2307/2669725openalex-snapshot
Accuracy and Stability of Numerical Algorithms
inferredcites →https://doi.org/10.56021/9781421407944openalex-snapshot
Matrix Computations

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.2457763openalex-extracted
Finding the Nearest Valid Covariance Matrix: A FX Market Case
inferred← citeshttps://doi.org/10.2139/ssrn.4588907openalex-extracted
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0182openalex-snapshot
Conic Optimization Software
inferred← citeshttps://doi.org/10.1002/9781118938218.ch7openalex-snapshot
Robust Adaptive Beamforming
inferred← citeshttps://doi.org/10.1002/9781394235971.ch1openalex-snapshot
Mathematical Logic
inferred← citeshttps://doi.org/10.1002/adc2.119openalex-snapshot
Computation of maximal output admissible sets for linear systems with polynomial constraints
inferred← citeshttps://doi.org/10.1002/asjc.1211openalex-snapshot
Robust Input Covariance Constraint Control for Uncertain Polytopic Systems
inferred← citeshttps://doi.org/10.1002/asjc.1375openalex-snapshot
Minimal Volume Simplex (MVS) Polytopic Model Generation and Manipulation Methodology for TP Model Transformation
inferred← citeshttps://doi.org/10.1002/asjc.982openalex-snapshot
Markov Chain Approach to Probabilistic Guidance for Swarms of Autonomous Agents
inferred← citeshttps://doi.org/10.1002/cjs.11532openalex-snapshot
High‐dimensional covariance matrix estimation using a low‐rank and diagonal decomposition
inferred← citeshttps://doi.org/10.1002/cpa.21727openalex-snapshot
ShapeFit: Exact Location Recovery from Corrupted Pairwise Directions
inferred← citeshttps://doi.org/10.1002/cplx.21727openalex-snapshot
Tracking control of chaotic spinning disks via nonlinear dynamic output feedback with input constraints
inferred← citeshttps://doi.org/10.1002/mma.5110openalex-snapshot
A projection‐based algorithm for ℓ2‐ℓp Tikhonov regularization
inferred← citeshttps://doi.org/10.1002/mp.12165openalex-snapshot
Use of proximal operator graph solver for radiation therapy inverse treatment planning
inferred← citeshttps://doi.org/10.1002/mp.17406openalex-snapshot
Existence, uniqueness, and efficiency of numerically unbiased attenuation pathlength estimators for photon counting detectors at low count rates
inferred← citeshttps://doi.org/10.1002/nag.2090openalex-snapshot
Stability of anchored sheet wall in cohesive‐frictional soils by FE limit analysis
inferred← citeshttps://doi.org/10.1002/nag.2781openalex-snapshot
Lower bound limit analysis of an anisotropic undrained strength criterion using second‐order cone programming
inferred← citeshttps://doi.org/10.1002/net.21880openalex-snapshot
Distributionally robust project crashing with partial or no correlation information
inferred← citeshttps://doi.org/10.1002/nla.2055openalex-snapshot
A nonconvex approach to low‐rank matrix completion using convex optimization
inferred← citeshttps://doi.org/10.1002/nla.2221openalex-snapshot
A Riemannian variant of the Fletcher–Reeves conjugate gradient method for stochastic inverse eigenvalue problems with partial eigendata
inferred← citeshttps://doi.org/10.1002/nla.2282openalex-snapshot
On approximating the nearest Ω‐stable matrix
inferred← citeshttps://doi.org/10.1002/nla.783openalex-snapshot
An alternating direction method for linear‐constrained matrix nuclear norm minimization
inferred← citeshttps://doi.org/10.1002/nme.1567openalex-snapshot
Lower bound limit analysis of cohesive‐frictional materials using second‐order cone programming
inferred← citeshttps://doi.org/10.1002/nme.2421openalex-snapshot
Upper and lower bounds in limit analysis: Adaptive meshing strategies and discontinuous loading
inferred← citeshttps://doi.org/10.1002/nme.4303openalex-snapshot
A note on upper bound formulations in limit analysis
inferred← citeshttps://doi.org/10.1002/nme.4476openalex-snapshot
A selective strategy for shakedown analysis of engineering structures
inferred← citeshttps://doi.org/10.1002/qute.202400140openalex-snapshot
Discrete‐Modulated Continuous‐Variable Quantum Key Distribution in Satellite‐to‐Ground Communication
inferred← citeshttps://doi.org/10.1002/rnc.3376openalex-snapshot
MIMO PID tuning via iterated LMI restriction
inferred← citeshttps://doi.org/10.1002/rnc.3646openalex-snapshot
Robustness analysis of uncertain discrete‐time systems with dissipation inequalities and integral quadratic constraints
inferred← citeshttps://doi.org/10.1002/rnc.7807openalex-snapshot
A Convex Optimization Approach to Compute Trapping Regions for Lossless Quadratic Systems
inferred← citeshttps://doi.org/10.1002/sam.10138openalex-snapshot
Reduced rank ridge regression and its kernel extensions
inferred← citeshttps://doi.org/10.1002/sta4.428openalex-snapshot
Community detection with nodal information: Likelihood and its variational approximation
inferred← citeshttps://doi.org/10.1002/wics.1345openalex-snapshot
Distance‐weighted discrimination
inferred← citeshttps://doi.org/10.1007/0-387-25592-3_5openalex-snapshot
Interior Point and Semidefinite Approaches in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4614-0769-0_18openalex-snapshot
Exploiting Sparsity in SDP Relaxation of Polynomial Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-1-4614-0769-0_20openalex-snapshot
Projection Methods in Conic Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4614-0769-0_23openalex-snapshot
The State-of-the-Art in Conic Optimization Software
inferred← citeshttps://doi.org/10.1007/978-1-4614-0769-0_25openalex-snapshot
On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0
inferred← citeshttps://doi.org/10.1007/978-1-4614-5128-0_17openalex-snapshot
Using a Distributed SDP Approach to Solve Simulated Protein Molecular Conformation Problems
inferred← citeshttps://doi.org/10.1007/978-1-4614-7621-4_12openalex-snapshot
Preprocessing and Regularization for Degenerate Semidefinite Programs
inferred← citeshttps://doi.org/10.1007/978-3-030-17953-3_16openalex-snapshot
A Bundle Approach for SDPs with Exact Subgraph Constraints
inferred← citeshttps://doi.org/10.1007/978-3-030-21733-4_12openalex-snapshot
Optimal Curing Strategy Enhancement of Epidemic Processes with Self-adaptive SBX Crossover
inferred← citeshttps://doi.org/10.1007/978-3-030-40616-5_14openalex-snapshot
Epidemic Spreading Curing Strategy Over Directed Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-43089-4_2openalex-snapshot
Designing Sparse Reliable Pose-Graph SLAM: A Graph-Theoretic Approach
inferred← citeshttps://doi.org/10.1007/978-3-031-04520-2_7openalex-snapshot
The Random QUBO
inferred← citeshttps://doi.org/10.1007/978-3-031-15286-3_3openalex-snapshot
Modern Portfolio Theory
inferred← citeshttps://doi.org/10.1007/978-3-031-71326-2_1openalex-snapshot
Solving Matrix Nearness Problems via Hamiltonian Systems, Matrix Factorization, and Optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-03841-4_24openalex-snapshot
COAST: A Convex Optimization Approach to Stress-Based Embedding
inferred← citeshttps://doi.org/10.1007/978-3-319-10590-1_34openalex-snapshot
Learning to Rank 3D Features
inferred← citeshttps://doi.org/10.1007/978-3-319-16706-0_30openalex-snapshot
Deconvolution of Ensemble Chromatin Interaction Data Reveals the Latent Mixing Structures in Cell Subpopulations
inferred← citeshttps://doi.org/10.1007/978-3-319-24947-6_6openalex-snapshot
A Convex Relaxation Approach to the Affine Subspace Clustering Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-32859-1_45openalex-snapshot
A New Matrix Splitting Based Relaxation for the Quadratic Assignment Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-40229-1_14openalex-snapshot
Interpolant Synthesis for Quadratic Polynomial Inequalities and Combination with EUF
inferred← citeshttps://doi.org/10.1007/978-3-319-42056-1_7openalex-snapshot
Matrix-Free Convex Optimization Modeling
inferred← citeshttps://doi.org/10.1007/978-3-319-47016-0_13openalex-snapshot
MARS: A Toolkit for Modelling, Analysis, and Verification of Hybrid Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-48628-4_3openalex-snapshot
MARS: A Toolchain for Modelling, Analysis and Verification of Hybrid Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-56669-6_3openalex-snapshot
Multi-Objective Resource Allocation Optimization for SWIPT in Small-Cell Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-67308-0_39openalex-snapshot
Capital Asset Pricing Model—A Structured Robust Approach
inferred← citeshttps://doi.org/10.1007/978-3-319-71583-4_13openalex-snapshot
A Generator of Nonregular Semidefinite Programming Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-73758-4_10openalex-snapshot
Optimal Transmission Network Topology for Resilient Power Supply
inferred← citeshttps://doi.org/10.1007/978-3-540-69162-4_35openalex-snapshot
Learning a Kernel Matrix for Time Series Data from DTW Distances
inferred← citeshttps://doi.org/10.1007/978-3-540-85097-7_7openalex-snapshot
New Algorithms for k-Center and Extensions
inferred← citeshttps://doi.org/10.1007/978-3-642-11339-0_4openalex-snapshot
Interior Point Methods for Nonlinear Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-12297-2_27openalex-snapshot
A Variant of the Trace Quotient Formulation for Dimensionality Reduction
inferred← citeshttps://doi.org/10.1007/978-3-642-12598-0_2openalex-snapshot
A Robust H∞ Quasi-LPV Approach for Designing Nonlinear Observers
inferred← citeshttps://doi.org/10.1007/978-3-642-22092-0_45openalex-snapshot
Nonnegative Factorization of Diffusion Tensor Images and Its Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-27497-8_9openalex-snapshot
Maximum Variance Unfolding
inferred← citeshttps://doi.org/10.1007/978-3-642-29627-7_1openalex-snapshot
Protein Structure by Semidefinite Facial Reduction
inferred← citeshttps://doi.org/10.1007/978-3-642-34100-7_9openalex-snapshot
Design Techniques
inferred← citeshttps://doi.org/10.1007/978-3-662-53413-7_21openalex-snapshot
Validating Numerical Semidefinite Programming Solvers for Polynomial Invariants
inferred← citeshttps://doi.org/10.1007/978-3-7643-8923-9_16openalex-snapshot
A New Non-linear Semidefinite Programming Algorithm with an Application to Multidisciplinary Free Material Optimization
inferred← citeshttps://doi.org/10.1007/978-94-007-6827-7_4openalex-snapshot
Computation of Bounds for Anchor Problems in Limit Analysis and Decomposition Techniques
inferred← citeshttps://doi.org/10.1007/978-981-97-4010-9_55openalex-snapshot
Online Trajectory Planning of Morphing Vehicle Based on Sequential Convex Programming
inferred← citeshttps://doi.org/10.1007/bf03186539openalex-snapshot
On verified numerical computations in convex programming
inferred← citeshttps://doi.org/10.1007/s00158-009-0376-2openalex-snapshot
Second-order cone programming formulations for a class of problems in structural optimization
inferred← citeshttps://doi.org/10.1007/s00158-019-02199-6openalex-snapshot
A data-driven approach to non-parametric reliability-based design optimization of structures with uncertain load
inferred← citeshttps://doi.org/10.1007/s00158-019-02295-7openalex-snapshot
Fail-safe truss topology optimization
inferred← citeshttps://doi.org/10.1007/s00158-022-03436-1openalex-snapshot
The connection between digital-twin model and physical space for rotating blade: an atomic norm-based BTT undersampled signal reconstruction method
inferred← citeshttps://doi.org/10.1007/s00186-013-0431-zopenalex-snapshot
Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem
inferred← citeshttps://doi.org/10.1007/s00332-017-9421-2openalex-snapshot
Bounding Averages Rigorously Using Semidefinite Programming: Mean Moments of the Lorenz System
inferred← citeshttps://doi.org/10.1007/s00365-013-9213-3openalex-snapshot
Alternating Projections on Nontangential Manifolds
inferred← citeshttps://doi.org/10.1007/s00366-026-02423-0openalex-snapshot
Machine learning-based design of optimal explicit Runge–Kutta schemes for compressible flow equations
inferred← citeshttps://doi.org/10.1007/s00371-018-1555-1openalex-snapshot
Low-rank and sparse matrix decomposition via the truncated nuclear norm and a sparse regularizer
inferred← citeshttps://doi.org/10.1007/s00454-017-9892-9openalex-snapshot
Exact Simultaneous Recovery of Locations and Structure from Known Orientations and Corrupted Point Correspondences
inferred← citeshttps://doi.org/10.1007/s00466-011-0656-8openalex-snapshot
Shakedown analysis with multidimensional loading spaces
inferred← citeshttps://doi.org/10.1007/s00498-020-00269-5openalex-snapshot
Boundary control design for conservation laws in the presence of measurement disturbances
inferred← citeshttps://doi.org/10.1007/s00498-026-00437-zopenalex-snapshot
Hierarchical controller synthesis using ($$\upgamma ,\updelta $$)-Similarity
inferred← citeshttps://doi.org/10.1007/s00521-016-2343-3openalex-snapshot
Ellipsoidal support vector data description
inferred← citeshttps://doi.org/10.1007/s00603-020-02099-yopenalex-snapshot
Lower Bound Limit Analysis Using Power Cone Programming for Solving Stability Problems in Rock Mechanics for Generalized Hoek–Brown Criterion
inferred← citeshttps://doi.org/10.1007/s10107-002-0355-5openalex-snapshot
An independent benchmarking of SDP and SOCP solvers
inferred← citeshttps://doi.org/10.1007/s10107-004-0556-1openalex-snapshot
Product-form Cholesky factorization in interior point methods for second-order cone programming
inferred← citeshttps://doi.org/10.1007/s10107-006-0035-yopenalex-snapshot
Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems
inferred← citeshttps://doi.org/10.1007/s10107-006-0067-3openalex-snapshot
Dual versus primal-dual interior-point methods for linear and conic programming
inferred← citeshttps://doi.org/10.1007/s10107-006-0727-3openalex-snapshot
A matrix generation approach for eigenvalue optimization
inferred← citeshttps://doi.org/10.1007/s10107-008-0256-3openalex-snapshot
Generating and measuring instances of hard semidefinite programs
inferred← citeshttps://doi.org/10.1007/s10107-008-0261-6openalex-snapshot
Primal-dual first-order methods with $${\mathcal {O}(1/\epsilon)}$$ iteration-complexity for cone programming
inferred← citeshttps://doi.org/10.1007/s10107-009-0306-5openalex-snapshot
Fixed point and Bregman iterative methods for matrix rank minimization
inferred← citeshttps://doi.org/10.1007/s10107-010-0437-8openalex-snapshot
An implementable proximal point algorithmic framework for nuclear norm minimization
inferred← citeshttps://doi.org/10.1007/s10107-012-0515-1openalex-snapshot
Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization
inferred← citeshttps://doi.org/10.1007/s10107-015-0878-1openalex-snapshot
Generalized Gauss inequalities via semidefinite programming
inferred← citeshttps://doi.org/10.1007/s10107-015-0879-0openalex-snapshot
Exploiting symmetry in copositive programs via semidefinite hierarchies
inferred← citeshttps://doi.org/10.1007/s10107-016-1019-1openalex-snapshot
On reduced semidefinite programs for second order moment bounds with applications
inferred← citeshttps://doi.org/10.1007/s10107-018-1265-5openalex-snapshot
A new use of Douglas–Rachford splitting for identifying infeasible, unbounded, and pathological conic programs
inferred← citeshttps://doi.org/10.1007/s10107-018-1281-5openalex-snapshot
An inexact dual logarithmic barrier method for solving sparse semidefinite programs
inferred← citeshttps://doi.org/10.1007/s10107-019-01453-5openalex-snapshot
Exploiting Partial Correlations in Distributionally Robust Optimization
inferred← citeshttps://doi.org/10.1007/s10107-020-01512-2openalex-snapshot
A computational study of exact subgraph based SDP bounds for Max-Cut, stable set and coloring
inferred← citeshttps://doi.org/10.1007/s10107-020-01590-2openalex-snapshot
Role of sparsity and structure in the optimization landscape of non-convex matrix sensing
inferred← citeshttps://doi.org/10.1007/s10107-020-01610-1openalex-snapshot
Sparse noncommutative polynomial optimization
inferred← citeshttps://doi.org/10.1007/s10107-022-01888-3openalex-snapshot
Difference of convex algorithms for bilevel programs with applications in hyperparameter selection
inferred← citeshttps://doi.org/10.1007/s10107-022-01896-3openalex-snapshot
Solving orthogonal group synchronization via convex and low-rank optimization: tightness and landscape analysis
inferred← citeshttps://doi.org/10.1007/s10107-023-01952-6openalex-snapshot
Solving graph equipartition SDPs on an algebraic variety
inferred← citeshttps://doi.org/10.1007/s10107-024-02137-5openalex-snapshot
Complexity of chordal conversion for sparse semidefinite programs with small treewidth
inferred← citeshttps://doi.org/10.1007/s10208-018-9388-xopenalex-snapshot
Optimization Based Methods for Partially Observed Chaotic Systems
inferred← citeshttps://doi.org/10.1007/s10287-010-0126-3openalex-snapshot
Estimation of risk-neutral density surfaces
inferred← citeshttps://doi.org/10.1007/s10287-011-0132-0openalex-snapshot
Robust international portfolio management
inferred← citeshttps://doi.org/10.1007/s10444-011-9261-9openalex-snapshot
Splitting and linearizing augmented Lagrangian algorithm for subspace recovery from corrupted observations
inferred← citeshttps://doi.org/10.1007/s10479-018-2978-9openalex-snapshot
Improved row-by-row method for binary quadratic optimization problems
inferred← citeshttps://doi.org/10.1007/s10479-020-03820-4openalex-snapshot
Optimizing over the properly efficient set of convex multi-objective optimization problems
inferred← citeshttps://doi.org/10.1007/s10489-012-0356-xopenalex-snapshot
Accelerated max-margin multiple kernel learning
inferred← citeshttps://doi.org/10.1007/s10514-015-9470-zopenalex-snapshot
Decentralized probabilistic density control of autonomous swarms with safety constraints
inferred← citeshttps://doi.org/10.1007/s10589-005-3060-5openalex-snapshot
On Extracting Maximum Stable Sets in Perfect Graphs Using Lovász's Theta Function
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-005-4565-7openalex-snapshot
Efficient Algorithms for the Smallest Enclosing Ball Problem
inferred← citeshttps://doi.org/10.1007/s10589-006-9002-zopenalex-snapshot
A conversion of an SDP having free variables into the standard form SDP
inferred← citeshttps://doi.org/10.1007/s10589-007-9030-3openalex-snapshot
Implementation of a primal–dual method for SDP on a shared memory parallel architecture
inferred← citeshttps://doi.org/10.1007/s10589-007-9141-xopenalex-snapshot
A second-order cone cutting surface method: complexity and application
inferred← citeshttps://doi.org/10.1007/s10589-008-9187-4openalex-snapshot
A parallel interior point decomposition algorithm for block angular semidefinite programs
inferred← citeshttps://doi.org/10.1007/s10589-012-9520-9openalex-snapshot
SDP reformulation for robust optimization problems based on nonconvex QP duality
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-9634-8openalex-snapshot
Robust least square semidefinite programming with applications
inferred← citeshttps://doi.org/10.1007/s10589-015-9731-yopenalex-snapshot
Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques
inferred← citeshttps://doi.org/10.1007/s10589-015-9750-8openalex-snapshot
AAR-based decomposition algorithm for non-linear convex optimisation
inferred← citeshttps://doi.org/10.1007/s10589-015-9779-8openalex-snapshot
Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem
inferred← citeshttps://doi.org/10.1007/s10589-015-9812-yopenalex-snapshot
On how to solve large-scale log-determinant optimization problems
inferred← citeshttps://doi.org/10.1007/s10589-016-9874-5openalex-snapshot
A polynomial primal-dual affine scaling algorithm for symmetric conic optimization
inferred← citeshttps://doi.org/10.1007/s10589-016-9879-0openalex-snapshot
A robust Lagrangian-DNN method for a class of quadratic optimization problems
inferred← citeshttps://doi.org/10.1007/s10589-017-9898-5openalex-snapshot
$$S_{1/2}$$ S 1 / 2 regularization methods and fixed point algorithms for affine rank minimization problems
inferred← citeshttps://doi.org/10.1007/s10589-017-9943-4openalex-snapshot
The min-cut and vertex separator problem
inferred← citeshttps://doi.org/10.1007/s10589-018-0012-4openalex-snapshot
Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier
inferred← citeshttps://doi.org/10.1007/s10589-018-0013-3openalex-snapshot
Robust truss topology optimization via semidefinite programming with complementarity constraints: a difference-of-convex programming approach
inferred← citeshttps://doi.org/10.1007/s10589-019-00058-0openalex-snapshot
A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme
inferred← citeshttps://doi.org/10.1007/s10589-019-00103-yopenalex-snapshot
Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning
inferred← citeshttps://doi.org/10.1007/s10589-019-00118-5openalex-snapshot
On the conditions for the finite termination of ADMM and its applications to SOS polynomials feasibility problems
inferred← citeshttps://doi.org/10.1007/s10589-020-00228-5openalex-snapshot
An accelerated active-set algorithm for a quadratic semidefinite program with general constraints
inferred← citeshttps://doi.org/10.1007/s10589-022-00402-xopenalex-snapshot
A stabilized sequential quadratic semidefinite programming method for degenerate nonlinear semidefinite programs
inferred← citeshttps://doi.org/10.1007/s10589-023-00479-yopenalex-snapshot
DC semidefinite programming and cone constrained DC optimization II: local search methods
inferred← citeshttps://doi.org/10.1007/s10589-024-00599-zopenalex-snapshot
The weighted Euclidean one-center problem in $${\mathbb {R}}^n$$
inferred← citeshttps://doi.org/10.1007/s10589-024-00614-3openalex-snapshot
Proximal-stabilized semidefinite programming
inferred← citeshttps://doi.org/10.1007/s10589-024-00621-4openalex-snapshot
On a minimization problem of the maximum generalized eigenvalue: properties and algorithms
inferred← citeshttps://doi.org/10.1007/s10589-026-00782-4openalex-snapshot
Tractable hierarchies of convex relaxations for polynomial optimization on the nonnegative orthant
inferred← citeshttps://doi.org/10.1007/s10703-017-0302-yopenalex-snapshot
Validating numerical semidefinite programming solvers for polynomial invariants
inferred← citeshttps://doi.org/10.1007/s10851-014-0545-9openalex-snapshot
Rank-Constrained Fundamental Matrix Estimation by Polynomial Global Optimization Versus the Eight-Point Algorithm
inferred← citeshttps://doi.org/10.1007/s10878-009-9226-9openalex-snapshot
New algorithms for k-center and extensions
inferred← citeshttps://doi.org/10.1007/s10878-019-00517-8openalex-snapshot
Solution of boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation
inferred← citeshttps://doi.org/10.1007/s10898-006-9088-yopenalex-snapshot
A finite steps algorithm for solving convex feasibility problems
inferred← citeshttps://doi.org/10.1007/s10898-011-9758-2openalex-snapshot
An alternating variable method for the maximal correlation problem
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-018-0676-4openalex-snapshot
Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems
inferred← citeshttps://doi.org/10.1007/s10898-019-00771-4openalex-snapshot
A Euclidean distance matrix model for protein molecular conformation
inferred← citeshttps://doi.org/10.1007/s10898-019-00795-wopenalex-snapshot
Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods
inferred← citeshttps://doi.org/10.1007/s10898-022-01188-2openalex-snapshot
A facial reduction approach for the single source localization problem
inferred← citeshttps://doi.org/10.1007/s10898-023-01313-9openalex-snapshot
Hausdorff distance between convex semialgebraic sets
inferred← citeshttps://doi.org/10.1007/s10898-023-01322-8openalex-snapshot
A singular value shrinkage thresholding algorithm for folded concave penalized low-rank matrix optimization problems
inferred← citeshttps://doi.org/10.1007/s10915-011-9507-1openalex-snapshot
Alternating Direction Method for Covariance Selection Models
inferred← citeshttps://doi.org/10.1007/s10915-015-0045-0openalex-snapshot
An Alternating Direction Method with Continuation for Nonconvex Low Rank Minimization
inferred← citeshttps://doi.org/10.1007/s10915-019-00907-4openalex-snapshot
An Efficient Numerical Method for the Symmetric Positive Definite Second-Order Cone Linear Complementarity Problem
inferred← citeshttps://doi.org/10.1007/s10957-007-9254-5openalex-snapshot
Approximate Toeplitz Matrix Problem Using Semidefinite Programming
inferred← citeshttps://doi.org/10.1007/s10957-010-9776-0openalex-snapshot
A Smoothing Newton Method with Fischer-Burmeister Function for Second-Order Cone Complementarity Problems
inferred← citeshttps://doi.org/10.1007/s10957-012-0145-zopenalex-snapshot
An Extended Sequential Quadratically Constrained Quadratic Programming Algorithm for Nonlinear, Semidefinite, and Second-Order Cone Programming
inferred← citeshttps://doi.org/10.1007/s10957-019-01493-zopenalex-snapshot
On a Box-Constrained Linear Symmetric Cone Optimization Problem
inferred← citeshttps://doi.org/10.1007/s10957-021-01869-0openalex-snapshot
Analysis of Optimization Algorithms via Sum-of-Squares
inferred← citeshttps://doi.org/10.1007/s10957-022-02020-3openalex-snapshot
On the Approximation of Unbounded Convex Sets by Polyhedra
inferred← citeshttps://doi.org/10.1007/s10957-024-02581-5openalex-snapshot
First-Order Methods for Nonnegative Trigonometric Matrix Polynomials
inferred← citeshttps://doi.org/10.1007/s10957-025-02724-2openalex-snapshot
Robust Boundary Output-Feedback Control of a Reaction-Diffusion Equation with In-Domain Disturbances
inferred← citeshttps://doi.org/10.1007/s10957-025-02883-2openalex-snapshot
A Vectorized Positive Semidefinite Penalty Method for Unconstrained Binary Quadratic Programming
inferred← citeshttps://doi.org/10.1007/s10994-013-5366-3openalex-snapshot
Learning with tensors: a framework based on convex optimization and spectral regularization
inferred← citeshttps://doi.org/10.1007/s10994-016-5602-8openalex-snapshot
A unified probabilistic framework for robust manifold learning and embedding
inferred← citeshttps://doi.org/10.1007/s11045-014-0312-5openalex-snapshot
A fast design algorithm for elliptic-error and phase-error constrained LS 2-D FIR filters
inferred← citeshttps://doi.org/10.1007/s11045-018-0549-5openalex-snapshot
A new nonconvex approach to low-rank matrix completion with application to image inpainting
inferred← citeshttps://doi.org/10.1007/s11063-012-9224-2openalex-snapshot
Integrating Spectral Kernel Learning and Constraints in Semi-Supervised Classification
inferred← citeshttps://doi.org/10.1007/s11063-013-9285-xopenalex-snapshot
Supervised Distance Preserving Projections
inferred← citeshttps://doi.org/10.1007/s11075-009-9309-9openalex-snapshot
Semi-definite programming techniques for structured quadratic inverse eigenvalue problems
inferred← citeshttps://doi.org/10.1007/s11075-014-9876-2openalex-snapshot
A non-convex algorithm framework based on DC programming and DCA for matrix completion
inferred← citeshttps://doi.org/10.1007/s11075-020-00933-6openalex-snapshot
Extension of the LP-Newton method to conic programming problems via semi-infinite representation
inferred← citeshttps://doi.org/10.1007/s11081-011-9144-4openalex-snapshot
Second-order cone programming with warm start for elastoplastic analysis with von Mises yield criterion
inferred← citeshttps://doi.org/10.1007/s11081-012-9188-0openalex-snapshot
Quadratic model updating with gyroscopic structure from partial eigendata
inferred← citeshttps://doi.org/10.1007/s11081-015-9294-xopenalex-snapshot
Variations and extension of the convex–concave procedure
inferred← citeshttps://doi.org/10.1007/s11081-017-9372-3openalex-snapshot
Alternating direction method of multipliers for truss topology optimization with limited number of nodes: a cardinality-constrained second-order cone programming approach
inferred← citeshttps://doi.org/10.1007/s11081-019-09448-zopenalex-snapshot
Stochastic hydro-thermal unit commitment via multi-level scenario trees and bundle regularization
inferred← citeshttps://doi.org/10.1007/s11128-020-02726-1openalex-snapshot
Numerical detection of Gaussian entanglement and its application to the identification of bound entangled Gaussian states
inferred← citeshttps://doi.org/10.1007/s11147-018-9148-8openalex-snapshot
Portfolio benefits of adding corporate credit default swap indices: evidence from North America and Europe
inferred← citeshttps://doi.org/10.1007/s11228-025-00758-2openalex-snapshot
Variational Analysis of Unbounded and Discontinuous Generalized Eigenvalue Functions with Application to Topology Optimization
inferred← citeshttps://doi.org/10.1007/s11263-015-0865-2openalex-snapshot
Efficient Semidefinite Branch-and-Cut for MAP-MRF Inference
inferred← citeshttps://doi.org/10.1007/s11276-016-1331-yopenalex-snapshot
A conflict avoidance scheme between mobility load balancing and mobility robustness optimization in self-organizing networks
inferred← citeshttps://doi.org/10.1007/s11424-010-8057-1openalex-snapshot
An equivalency condition of nonsingularity in nonlinear semidefinite programming
inferred← citeshttps://doi.org/10.1007/s11424-022-0015-1openalex-snapshot
Limited Memory BFGS Method for Least Squares Semidefinite Programming with Banded Structure
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/s11432-015-5339-1openalex-snapshot
Dynamic decoupling tracking control for the polytopic LPV model of hypersonic vehicle
inferred← citeshttps://doi.org/10.1007/s11590-006-0009-2openalex-snapshot
An SQP-type algorithm for nonlinear second-order cone programs
inferred← citeshttps://doi.org/10.1007/s11590-015-0911-6openalex-snapshot
A characterization of the weighted Lovász number based on convex quadratic programming
showing the first 200 of 1071
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.