| Publication | Date of Publication | Type |
|---|
Piecewise SOS-Convex Moment Optimization and Applications via Exact Semi-Definite Programs
(available as arXiv preprint) | N/A | Paper |
Piecewise sum-of-squares convexity and Wasserstein distributionally robust optimization: exact semi-definite programming reformulations with data-driven decision-making under uncertainty
European Journal of Operational Research | 2026-09-07 | Paper |
Hidden convexity of separable polynomial systems: exact semi-definite programs for a class of moment-ambiguity distributionally robust optimization problems
Optimization | 2026-08-05 | Paper |
Convergent lifted Lasserre hierarchy of SDPs for minimizing expectation of piecewise polynomial loss over Wasserstein balls
Journal of Optimization Theory and Applications | 2026-05-29 | Paper |
A duality-guided proximal splitting method for robust constrained best approximation via convex semi-definite program reformulations
Set-Valued and Variational Analysis | 2026-03-16 | Paper |
A distributionally robust machine learning model of simultaneous classification and feature selection under data uncertainty: theory, methods, and application to the identification of Alzheimer's disease using handwriting
EURO Journal on Computational Optimization | 2025-12-19 | Paper |
Convexifiable quadratic inequality systems: new minimax S-lemma and exact SOCPs for classes of distributionally robust optimization problems
Journal of Global Optimization | 2025-07-29 | Paper |
Adjustable robust multiobjective linear optimization: Pareto optimal solutions via conic programming
Annals of Operations Research | 2025-04-03 | Paper |
Piecewise SOS-convex moment optimization and applications via exact semi-definite programs
EURO Journal on Computational Optimization | 2025-03-03 | Paper |
The stability of robustness for conic linear programs with uncertain data
Journal of Optimization Theory and Applications | 2024-11-27 | Paper |
Affinely adjustable robust optimization for radiation therapy under evolving data uncertainty via semi-definite programming
Optimization | 2024-06-01 | Paper |
A distributional Farkas' lemma and moment optimization problems with no-gap dual semi-definite programs
Optimization Letters | 2024-05-22 | Paper |
Sum-of-squares relaxations in robust DC optimization and feature selection
Journal of Optimization Theory and Applications | 2024-01-25 | Paper |
Quadratically adjustable robust linear optimization with inexact data via generalized S-lemma: exact second-order cone program reformulations
EURO Journal on Computational Optimization | 2023-07-12 | Paper |
Sums of squares polynomial program reformulations for adjustable robust linear optimization problems with separable polynomial decision rules
Set-Valued and Variational Analysis | 2023-01-05 | Paper |
Exact dual semi-definite programs for affinely adjustable robust SOS-convex polynomial optimization problems
Optimization | 2022-11-04 | Paper |
Robust optimization and data classification for characterization of Huntington disease onset via duality methods
Journal of Optimization Theory and Applications | 2022-05-17 | Paper |
Exact SDP reformulations of adjustable robust linear programs with box uncertainties under separable quadratic decision rules via SOS representations of non-negativity
Journal of Global Optimization | 2021-11-26 | Paper |
The radius of robust feasibility of uncertain mathematical programs: a survey and recent developments
European Journal of Operational Research | 2021-11-09 | Paper |
Calculating radius of robust feasibility of uncertain linear conic programs via semi-definite programs
Journal of Optimization Theory and Applications | 2021-06-15 | Paper |
Generalized Farkas lemma with adjustable variables and two-stage robust linear programs
Journal of Optimization Theory and Applications | 2021-05-11 | Paper |
Exact conic programming reformulations of two-stage adjustable robust linear programs with new quadratic decision rules
Optimization Letters | 2021-02-26 | Paper |
A copositive Farkas lemma and minimally exact conic relaxations for robust quadratic optimization with binary and quadratic constraints
Operations Research Letters | 2020-02-10 | Paper |
A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs
Journal of Global Optimization | 2019-12-03 | Paper |
Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality
European Journal of Operational Research | 2019-09-18 | Paper |
Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications
Applied Mathematics and Computation | 2019-04-29 | Paper |
Convergent conic linear programming relaxations for cone convex polynomial programs
Operations Research Letters | 2019-02-22 | Paper |
A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems
Operations Research Letters | 2019-02-22 | Paper |
Characterizing best approximation from a convex set without convex representation
Journal of Approximation Theory | 2019-02-07 | Paper |
Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers
Journal of Global Optimization | 2018-12-27 | Paper |
| Tight SDP relaxations for a class of robust SOS-convex polynomial programs without the Slater condition | 2018-11-27 | Paper |
A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs
Operations Research Letters | 2018-09-28 | Paper |
Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness
Operations Research Letters | 2018-08-27 | Paper |
Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations
Journal of Global Optimization | 2018-07-18 | Paper |
Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs
European Journal of Operational Research | 2018-05-31 | Paper |
Exact second-order cone programming relaxations for some nonconvex minimax quadratic optimization problems
SIAM Journal on Optimization | 2018-04-03 | Paper |
Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation
European Journal of Operational Research | 2017-11-23 | Paper |
| A Bounded Degree Lasserre Hierarchy with SOCP Relaxations for Global Polynomial Optimization and Applications | 2017-10-18 | Paper |
An exact formula for radius of robust feasibility of uncertain linear programs
Journal of Optimization Theory and Applications | 2017-09-01 | Paper |
Finding robust global optimal values of bilevel polynomial programs with uncertain linear constraints
Journal of Optimization Theory and Applications | 2017-07-20 | Paper |
Exact conic programming relaxations for a class of convex polynomial cone programs
Journal of Optimization Theory and Applications | 2017-02-23 | Paper |
A generalized Farkas lemma with a numerical certificate and linear semi-infinite programs with SDP duals
Linear Algebra and its Applications | 2016-12-29 | Paper |
Robust solutions to multi-objective linear programs with uncertain data
European Journal of Operational Research | 2016-07-26 | Paper |
Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets
Journal of Global Optimization | 2016-05-25 | Paper |
Generalized Farkas' lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization
Journal of Global Optimization | 2016-04-29 | Paper |
Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems
SIAM Journal on Optimization | 2016-03-30 | Paper |
Sums of squares characterizations of containment of convex semialgebraic sets
Pacific Journal of Optimization | 2016-02-26 | Paper |
Generalized SOS-convexity and strong duality with SDP dual programs in polynomial optimization
Journal of Convex Analysis | 2016-02-26 | Paper |
Robust global error bounds for uncertain linear inequality systems with applications
Linear Algebra and its Applications | 2016-01-28 | Paper |
| Robust Global Solutions of Bilevel Polynomial Optimization Problems with Uncertain Linear Constraints | 2016-01-24 | Paper |
Characterizing robust local error bounds for linear inequality systems under data uncertainty
Linear Algebra and its Applications | 2015-11-17 | Paper |
Robust duality in parametric convex optimization
Set-Valued and Variational Analysis | 2015-08-24 | Paper |
Strong duality for robust minimax fractional programming problems
European Journal of Operational Research | 2015-07-28 | Paper |
Characterizing robust solution sets of convex programs under data uncertainty
Journal of Optimization Theory and Applications | 2015-03-11 | Paper |
Robust SOS-convex polynomial optimization problems: exact SDP relaxations
Optimization Letters | 2015-02-23 | Paper |
A new class of alternative theorems for SOS-convex inequalities and robust optimization
Applicable Analysis | 2015-02-20 | Paper |
Robust solutions of multiobjective linear semi-infinite programs under constraint data uncertainty
SIAM Journal on Optimization | 2014-12-12 | Paper |
On polynomial optimization over non-compact semi-algebraic sets
Journal of Optimization Theory and Applications | 2014-12-12 | Paper |
Dual semidefinite programs without duality gaps for a class of convex minimax programs
Journal of Optimization Theory and Applications | 2014-10-23 | Paper |
Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
Mathematical Programming. Series A. Series B | 2014-10-17 | Paper |
Farkas' lemma: three decades of generalizations for mathematical optimization
Top | 2014-10-08 | Paper |
Rejoinder on: ``Farkas' lemma: three decades of generalizations for mathematical optimization''
Top | 2014-10-08 | Paper |
Support vector machine classifiers with uncertain knowledge sets via robust optimization
Optimization | 2014-08-05 | Paper |
Strong duality in robust semi-definite linear programming under data uncertainty
Optimization | 2014-07-10 | Paper |
Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations
Journal of Global Optimization | 2014-04-01 | Paper |
Necessary and sufficient conditions for S-lemma and~nonconvex quadratic optimization
Optimization and Engineering | 2013-10-24 | Paper |
Some robust convex programs without a duality gap
Journal of Convex Analysis | 2013-07-24 | Paper |
Robust linear semi-infinite programming duality under uncertainty
Mathematical Programming. Series A. Series B | 2013-07-12 | Paper |
Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty
Journal of Global Optimization | 2013-03-11 | Paper |
Exact SDP relaxations for classes of nonlinear semidefinite programming problems
Operations Research Letters | 2013-03-05 | Paper |
Robust best approximation with interpolation constraints under ellipsoidal uncertainty: strong duality and nonsmooth Newton methods
Nonlinear Analysis. Theory, Methods & Applications. Series A: Theory and Methods | 2013-03-04 | Paper |
Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty
Journal of Mathematical Analysis and Applications | 2012-07-04 | Paper |
New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs
Nonlinear Analysis. Theory, Methods & Applications. Series A: Theory and Methods | 2012-06-09 | Paper |
Robust duality for fractional programming problems with constraint-wise data uncertainty
Journal of Optimization Theory and Applications | 2012-01-12 | Paper |
Robust duality for generalized convex programming problems under data uncertainty
Nonlinear Analysis. Theory, Methods & Applications. Series A: Theory and Methods | 2011-12-21 | Paper |
A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty
Operations Research Letters | 2011-08-09 | Paper |
Robust Farkas' lemma for uncertain linear systems with applications
Positivity | 2011-06-28 | Paper |
Glogal optimality conditions for classes of non-convex multi-objective quadratic optimization problems
Variational Analysis and Generalized Differentiation in Optimization and Control | 2011-04-20 | Paper |
Strong duality in robust convex programming: complete characterizations
SIAM Journal on Optimization | 2011-03-21 | Paper |
Robust conjugate duality for convex optimization under uncertainty with application to data classification
Nonlinear Analysis. Theory, Methods & Applications. Series A: Theory and Methods | 2011-03-14 | Paper |
Necessary global optimality conditions for nonlinear programming problems with polynomial constraints
Mathematical Programming. Series A. Series B | 2011-02-14 | Paper |
Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems
Journal of Global Optimization | 2011-01-19 | Paper |
New strong duality results for convex programs with separable constraints
European Journal of Operational Research | 2010-12-20 | Paper |
Constraint qualifications characterizing Lagrangian duality in convex optimization
Journal of Optimization Theory and Applications | 2010-09-22 | Paper |
Stability, stabilization and duality for linear time-varying systems
Optimization | 2010-07-26 | Paper |
Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
Mathematical Programming. Series A. Series B | 2010-07-21 | Paper |
Simultaneous classification and feature selection via convex quadratic programming with application to HIV-associated neurocognitive disorder assessment
European Journal of Operational Research | 2010-06-11 | Paper |
Characterizing robust set containments and solutions of uncertain linear programs without qualifications
Operations Research Letters | 2010-06-08 | Paper |
Alternative theorems for quadratic inequality systems and global quadratic optimization
SIAM Journal on Optimization | 2010-06-01 | Paper |
| Distinguishing a global minimizer from local minimizers of quadratic minimization with mixed variables | 2010-05-28 | Paper |
Global optimality conditions for nonlinear programming problems with bounds via quadratic underestimators
Optimization | 2010-04-21 | Paper |
A note on sufficient global optimality conditions for fixed charge quadratic programs
Applied Mathematics Letters | 2010-01-29 | Paper |
| scientific article; zbMATH DE number 5662944 (Why is no real title available?) | 2010-01-26 | Paper |
Farkas' lemma for separable sublinear inequalities without qualifications
Optimization Letters | 2009-10-15 | Paper |
Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs
Journal of Mathematical Analysis and Applications | 2009-09-10 | Paper |
| Necessary and sufficient conditions for globally stable convex minimax theorems | 2009-06-11 | Paper |
New Kuhn-Tucker sufficiency for global optimality via convexification
Nonlinear Analysis. Theory, Methods & Applications. Series A: Theory and Methods | 2009-06-09 | Paper |
New sufficiency for global optimality and duality of mathematical programming problems via underestimators
Journal of Optimization Theory and Applications | 2009-05-05 | Paper |
Geometric conditions for Kuhn-Tucker sufficiency of global optimality in mathematical programming
European Journal of Operational Research | 2009-02-23 | Paper |
Lagrange multiplier necessary conditions for global optimality for non-convex minimization over a quadratic constraint via S-lemma
Optimization Letters | 2009-02-17 | Paper |
