| Publication | Date of Publication | Type |
|---|
| A full splitting algorithm for fractional programs with structured numerators and denominators | 2023-12-21 | Paper |
| Quadratically adjustable robust linear optimization with inexact data via generalized S-lemma: exact second-order cone program reformulations | 2023-07-12 | Paper |
| Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems | 2023-06-07 | Paper |
| Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints | 2023-03-23 | Paper |
| Sums of squares polynomial program reformulations for adjustable robust linear optimization problems with separable polynomial decision rules | 2023-01-05 | Paper |
| Exact dual semi-definite programs for affinely adjustable robust SOS-convex polynomial optimization problems | 2022-11-04 | Paper |
| Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs | 2022-09-26 | Paper |
| Kurdyka-Łojasiewicz exponent via inf-projection | 2022-08-05 | Paper |
| Quadratic growth conditions and uniqueness of optimal solution to Lasso | 2022-06-03 | Paper |
| Robust optimization and data classification for characterization of Huntington disease onset via duality methods | 2022-05-17 | Paper |
| \(\mathrm{B}\)-subdifferentials of the projection onto the matrix simplex | 2021-12-08 | Paper |
| Exact SDP reformulations of adjustable robust linear programs with box uncertainties under separable quadratic decision rules via SOS representations of non-negativity | 2021-11-26 | Paper |
| The radius of robust feasibility of uncertain mathematical programs: a survey and recent developments | 2021-11-09 | Paper |
| Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints | 2021-06-16 | Paper |
| On the linear convergence of forward-backward splitting method. I: Convergence analysis | 2021-06-15 | Paper |
| Calculating radius of robust feasibility of uncertain linear conic programs via semi-definite programs | 2021-06-15 | Paper |
| Exact conic programming reformulations of two-stage adjustable robust linear programs with new quadratic decision rules | 2021-02-26 | Paper |
| A copositive Farkas lemma and minimally exact conic relaxations for robust quadratic optimization with binary and quadratic constraints | 2020-02-10 | Paper |
| A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs | 2019-12-03 | Paper |
| Efficiently Maximizing a Homogeneous Polynomial over Unit Sphere without Convex Relaxation | 2019-09-29 | Paper |
| Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality | 2019-09-18 | Paper |
| A proximal-projection partial bundle method for convex constrained minimax problems | 2019-07-23 | Paper |
| Further results on Cauchy tensors and Hankel tensors | 2019-03-19 | Paper |
| A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems | 2019-02-22 | Paper |
| Convergence rate analysis for the higher order power method in best rank one approximations of tensors | 2018-10-31 | Paper |
| A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs | 2018-09-28 | Paper |
| Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods | 2018-09-27 | Paper |
| Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness | 2018-08-27 | Paper |
| Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations | 2018-07-18 | Paper |
| On the Q-linear convergence of forward-backward splitting method and uniqueness of optimal solution to Lasso | 2018-06-17 | Paper |
| Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs | 2018-05-31 | Paper |
| A semidefinite program approach for computing the maximum eigenvalue of a class of structured tensors and its applications in hypergraphs and copositivity test | 2018-04-18 | Paper |
| Error bounds for parametric polynomial systems with applications to higher-order stability analysis and convergence rates | 2018-04-06 | Paper |
| Exact Second-Order Cone Programming Relaxations for Some Nonconvex Minimax Quadratic Optimization Problems | 2018-04-03 | Paper |
| Peaceman-Rachford splitting for a class of nonconvex optimization problems | 2017-12-22 | Paper |
| Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation | 2017-11-23 | Paper |
| A Bounded Degree Lasserre Hierarchy with SOCP Relaxations for Global Polynomial Optimization and Applications | 2017-10-18 | Paper |
| New Classes of Positive Semi-Definite Hankel Tensors | 2017-09-26 | Paper |
| Pseudo-spectra theory of tensors and tensor polynomial eigenvalue problems | 2017-09-21 | Paper |
| A note on alternating projections for ill-posed semidefinite feasibility problems | 2017-03-23 | Paper |
| Exact conic programming relaxations for a class of convex polynomial cone programs | 2017-02-23 | Paper |
| Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems | 2017-01-12 | Paper |
| SOS tensor decomposition: theory and applications | 2016-12-05 | Paper |
| Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems | 2016-09-16 | Paper |
| Positive semi-definiteness of generalized anti-circulant tensors | 2016-08-26 | Paper |
| Robust solutions to multi-objective linear programs with uncertain data | 2016-07-26 | Paper |
| Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets | 2016-05-25 | Paper |
| A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure | 2016-04-22 | Paper |
| Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems | 2016-03-30 | Paper |
| Global Convergence of Splitting Methods for Nonconvex Composite Optimization | 2015-12-11 | Paper |
| Finding the maximum eigenvalue of a class of tensors with applications in copositivity test and hypergraphs | 2015-11-07 | Paper |
| New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors | 2015-10-19 | Paper |
| Robust duality in parametric convex optimization | 2015-08-24 | Paper |
| Strong duality for robust minimax fractional programming problems | 2015-07-28 | Paper |
| Characterizing robust solution sets of convex programs under data uncertainty | 2015-03-11 | Paper |
| Robust SOS-convex polynomial optimization problems: exact SDP relaxations | 2015-02-23 | Paper |
| A new class of alternative theorems for SOS-convex inequalities and robust optimization | 2015-02-20 | Paper |
| The Z -eigenvalues of a symmetric tensor and its application to spectral hypergraph theory | 2015-01-06 | Paper |
| On polynomial optimization over non-compact semi-algebraic sets | 2014-12-12 | Paper |
| Robust Solutions of MultiObjective Linear Semi-Infinite Programs under Constraint Data Uncertainty | 2014-12-12 | Paper |
| SOS-Hankel Tensors: Theory and Application | 2014-10-26 | Paper |
| Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization | 2014-10-17 | Paper |
| Robust least square semidefinite programming with applications | 2014-09-26 | Paper |
| Support vector machine classifiers with uncertain knowledge sets via robust optimization | 2014-08-05 | Paper |
| A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs | 2014-07-23 | Paper |
| Strong duality in robust semi-definite linear programming under data uncertainty | 2014-07-10 | Paper |
| Analysis of the Convergence Rate for the Cyclic Projection Algorithm Applied to Basic Semialgebraic Convex Sets | 2014-06-19 | Paper |
| Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations | 2014-04-01 | Paper |
| Finding the maximum eigenvalue of essentially nonnegative symmetric tensors via sum of squares programming | 2013-11-11 | Paper |
| Necessary and sufficient conditions for \(S\)-lemma and~nonconvex quadratic optimization | 2013-10-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2841072 | 2013-07-24 | Paper |
| Robust linear semi-infinite programming duality under uncertainty | 2013-07-12 | Paper |
| Hölder Metric Subregularity with Applications to Proximal Point Method | 2013-04-09 | Paper |
| Global error bounds for piecewise convex polynomials | 2013-03-18 | Paper |
| Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty | 2013-03-11 | Paper |
| Exact SDP relaxations for classes of nonlinear semidefinite programming problems | 2013-03-05 | Paper |
| Robust best approximation with interpolation constraints under ellipsoidal uncertainty: strong duality and nonsmooth Newton methods | 2013-03-04 | Paper |
| Semismoothness of the maximum eigenvalue function of a symmetric tensor and its application | 2013-01-16 | Paper |
| Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty | 2012-07-04 | Paper |
| New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs | 2012-06-09 | Paper |
| Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition | 2012-05-08 | Paper |
| Robust duality for fractional programming problems with constraint-wise data uncertainty | 2012-01-12 | Paper |
| Robust duality for generalized convex programming problems under data uncertainty | 2011-12-21 | Paper |
| A working set SQCQP algorithm with simple nonmonotone penalty parameters | 2011-12-21 | Paper |
| A note on nonconvex minimax theorem with separable homogeneous polynomials | 2011-09-06 | Paper |
| A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty | 2011-08-09 | Paper |
| Robust Farkas' lemma for uncertain linear systems with applications | 2011-06-28 | Paper |
| Global Optimality Conditions for Classes of Non-convex Multi-objective Quadratic Optimization Problems | 2011-04-20 | Paper |
| Strong Duality in Robust Convex Programming: Complete Characterizations | 2011-03-21 | Paper |
| Robust conjugate duality for convex optimization under uncertainty with application to data classification | 2011-03-14 | Paper |
| Necessary global optimality conditions for nonlinear programming problems with polynomial constraints | 2011-02-14 | Paper |
| Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems | 2011-01-19 | Paper |
| New strong duality results for convex programs with separable constraints | 2010-12-20 | Paper |
| On the Asymptotically Well Behaved Functions and Global Error Bound for Convex Polynomials | 2010-12-03 | Paper |
| Global convergence of the Polak-Ribière-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems | 2010-11-07 | Paper |
| Characterizing robust set containments and solutions of uncertain linear programs without qualifications | 2010-06-08 | Paper |
| Error Bounds of Generalized D-Gap Functions for Nonsmooth and Nonmonotone Variational Inequality Problems | 2010-06-01 | Paper |
| Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization | 2010-06-01 | Paper |
| Error bound results for generalized D-gap functions of nonsmooth variational inequality problems | 2010-03-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5852066 | 2010-01-26 | Paper |
| Farkas' lemma for separable sublinear inequalities without qualifications | 2009-10-15 | Paper |
| Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs | 2009-09-10 | Paper |
| On Extension of Fenchel Duality and its Application | 2009-08-20 | Paper |
| Global convergence of modified Polak-Ribière-Polyak conjugate gradient methods with sufficient descent property | 2009-05-26 | Paper |
| On a separation principle for nonconvex sets | 2009-03-16 | Paper |
| A new version of the Liu-Storey conjugate gradient method | 2007-09-17 | Paper |
| Unified approach to some geometric results in variational analysis | 2007-07-25 | Paper |
| New conjugacy condition and related new conjugate gradient methods for unconstrained optimization | 2007-04-13 | Paper |
| New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems | 2006-10-31 | Paper |
| New quasi-Newton methods for unconstrained optimization problems | 2006-06-16 | Paper |
