Jiawang Nie

Orcid: 0000-0003-2637-8274

According to our database1, Jiawang Nie authored at least 67 papers between 2001 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Towards Global Solutions for Nonconvex Two-Stage Stochastic Programs: A Polynomial Lower Approximation Approach.
SIAM J. Optim., 2024

Finite Convergence of Moment-SOS Relaxations with Nonreal Radical Ideals.
SIAM J. Optim., 2024

Nash Equilibrium Problems of Polynomials.
Math. Oper. Res., 2024

The Rank-1 Completion Problem for Cubic Tensors.
CoRR, 2024

Diagonal Gaussian Mixture Models and Higher Order Tensor Decompositions.
CoRR, 2024

2023
Rational Generalized Nash Equilibrium Problems.
SIAM J. Optim., September, 2023

Convex generalized Nash equilibrium problems and polynomial optimization.
Math. Program., April, 2023

Generalized Truncated Moment Problems with Unbounded Sets.
J. Sci. Comput., April, 2023

Loss functions for finite sets.
Comput. Optim. Appl., March, 2023

Homogenization for polynomial optimization with unbounded sets.
Math. Program., 2023

Distributionally Robust Optimization with Moment Ambiguity Sets.
J. Sci. Comput., 2023

2022
Special Issue: Polynomial and Tensor Optimization.
Math. Program., 2022

The Saddle Point Problem of Polynomials.
Found. Comput. Math., 2022

Low Rank Tensor Decompositions and Approximations.
CoRR, 2022

Higher Order Correlation Analysis for Multi-View Learning.
CoRR, 2022

2021
A Lagrange Multiplier Expression Method for Bilevel Polynomial Optimization.
SIAM J. Optim., 2021

Learning Diagonal Gaussian Mixture Models and Incomplete Tensor Decompositions.
CoRR, 2021

The Gauss-Seidel method for generalized Nash equilibrium problems of polynomials.
Comput. Optim. Appl., 2021

2020
Hermitian Tensor Decompositions.
SIAM J. Matrix Anal. Appl., 2020

A Matrix Positivstellensatz with Lifting Polynomials.
SIAM J. Optim., 2020

Stochastic polynomial optimization.
Optim. Methods Softw., 2020

The maximum tensor complementarity eigenvalues.
Optim. Methods Softw., 2020

Preface.
Optim. Methods Softw., 2020

Symmetric Tensor Decompositions On Varieties.
CoRR, 2020

Preface to the special issue on optimization with polynomials and tensors.
Comput. Optim. Appl., 2020

2019
Hankel Tensor Decompositions and Ranks.
SIAM J. Matrix Anal. Appl., 2019

Tight relaxations for polynomial optimization and Lagrange multiplier expressions.
Math. Program., 2019

Completely Positive Binary Tensors.
Math. Oper. Res., 2019

2018
A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors.
SIAM J. Optim., 2018

Tensor eigenvalue complementarity problems.
Math. Program., 2018

Real eigenvalues of nonsymmetric tensors.
Comput. Optim. Appl., 2018

2017
Low Rank Symmetric Tensor Approximations.
SIAM J. Matrix Anal. Appl., 2017

Bilevel Polynomial Programs and Semidefinite Relaxation Methods.
SIAM J. Optim., 2017

Symmetric Tensor Nuclear Norms.
SIAM J. Appl. Algebra Geom., 2017

Generating Polynomials and Symmetric Tensor Decompositions.
Found. Comput. Math., 2017

2016
Positive Maps and Separable Matrices.
SIAM J. Optim., 2016

2015
Linear optimization with cones of moments and nonnegative polynomials.
Math. Program., 2015

The hierarchy of local minimums in polynomial optimization.
Math. Program., 2015

2014
Semidefinite Relaxations for Best Rank-1 Tensor Approximations.
SIAM J. Matrix Anal. Appl., 2014

All Real Eigenvalues of Symmetric Tensors.
SIAM J. Matrix Anal. Appl., 2014

Optimality conditions and finite convergence of Lasserre's hierarchy.
Math. Program., 2014

The A -Truncated $$K$$ K -Moment Problem.
Found. Comput. Math., 2014

2013
Polynomial Optimization with Real Varieties.
SIAM J. Optim., 2013

Certifying convergence of Lasserre's hierarchy via flat truncation.
Math. Program., 2013

An exact Jacobian SDP relaxation for polynomial optimization.
Math. Program., 2013

2012
Regularization Methods for SDP Relaxations in Large-Scale Polynomial Optimization.
SIAM J. Optim., 2012

First order conditions for semidefinite representations of convex sets defined by rational or singular polynomials.
Math. Program., 2012

Discriminants and nonnegative polynomials.
J. Symb. Comput., 2012

A Semidefinite Approach for Truncated K-Moment Problems.
Found. Comput. Math., 2012

2011
Polynomial Matrix Inequality and Semidefinite Representation.
Math. Oper. Res., 2011

2010
The algebraic degree of semidefinite programming.
Math. Program., 2010

Semidefinite representation of convex sets.
Math. Program., 2010

2009
Matrix Cubes Parameterized by Eigenvalues.
SIAM J. Matrix Anal. Appl., 2009

Algebraic Degree of Polynomial Optimization.
SIAM J. Optim., 2009

Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations.
SIAM J. Optim., 2009

Sufficient and Necessary Conditions for Semidefinite Representability of Convex Hulls and Sets.
SIAM J. Optim., 2009

Sum of squares method for sensor network localization.
Comput. Optim. Appl., 2009

2008
Approximate GCDs of polynomials and sparse SOS relaxations.
Theor. Comput. Sci., 2008

Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials.
SIAM J. Optim., 2008

Semidefinite Relaxation Bounds for Indefinite Homogeneous Quadratic Optimization.
SIAM J. Optim., 2008

Global minimization of rational functions and the nearest GCDs.
J. Glob. Optim., 2008

Structured semidefinite representation of some convex sets.
Proceedings of the 47th IEEE Conference on Decision and Control, 2008

2007
On the complexity of Putinar's Positivstellensatz.
J. Complex., 2007

Approximate GCDs of polynomials and SOS relaxation.
Proceedings of the Symbolic-Numeric Computation, 2007

2006
Minimizing Polynomials via Sum of Squares over the Gradient Ideal.
Math. Program., 2006

2005
Minimum Ellipsoid Bounds for Solutions of Polynomial Systems via Sum of Squares.
J. Glob. Optim., 2005

2001
A Predictor-Corrector Algorithm for QSDP Combining Dikin-Type and Newton Centering Steps.
Ann. Oper. Res., 2001


  Loading...