yusuke1997/dblp-id-title huggingface dataset:
A unified single-loop alternating gradient projection algorithm for nonconvex-concave and convex-nonconcave minimax problems
Facets and algorithms for capacitated lot sizing
Convex hull of two quadratic or a conic quadratic and a quadratic inequality
The generalized linear complementarity problem and an algorithm to find all its solutions
Improved approximations for two-stage min-cut and shortest path problems under uncertainty
Lifting convex inequalities for bipartite bilinear programs
Feasible directions algorithms for optimization problems with equality and inequality constraints
A study of exponential neighborhoods for the Travelling Salesman Problem and for the Quadratic Assignment Problem
Best approximation mappings in Hilbert spaces
Global optimization and simulated annealing
Characterizing and bounding the imperfection ratio for some classes of graphs
Augmented self-concordant barriers and nonlinear optimization problems with finite complexity
A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations
History of mathematical programming in the USSR: analyzing the phenomenon
An improved algorithm for the L 2 - L p minimization problem
Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm
A relationship between the second derivatives of a convex function and of its conjugate
The multiproximal linearization method for convex composite problems
Polyhedral properties of RLT relaxations of nonconvex quadratic programs and their implications on exact relaxations
New interval methods for constrained global optimization
Finite dimensional approximation in infinite dimensional mathematical programming
Contributions to the theory of stochastic programming
A numerical approach to optimization problems with variational inequality constraints
Polyhedra of regular p -nary group problems
Safe bounds in linear and mixed-integer linear programming
Extending the relationship between the conjugate gradient and BFGS algorithms
Applying Lehman's theorems to packing problems
On Pareto Optima, the Fermat-Weber Problem, and Polyhedral Gauges
A slightly lifted convex relaxation for nonconvex quadratic programming with ball constraints
Outer approximation for integer nonlinear programs via decision diagrams
Maximum entropy on the mean and the Cramér rate function in statistical estimation and inverse problems: properties, models, and algorithms
Maximal quadratic-free sets
On the global convergence of an SLP-filter algorithm that takes EQP steps
Differentiation formulas for probability functions: The transformation method
Shadow price of information in discrete time stochastic optimization
Implementing an efficient minimum capacity cut algorithm
A short note on the Q-linear convergence of the steepest descent method
An outer-approximation algorithm for a class of mixed-integer nonlinear programs
Dynamic node packing
On the behavior of the homogeneous self-dual model for conic convex optimization
Projective splitting with forward steps
Separating doubly nonnegative and completely positive matrices
A 3-approximation algorithm for the facility location problem with uniform capacities
Subgradient of distance functions with applications to Lipschitzian stability
Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs
The mathematics of eigenvalue optimization
Facet Identification for the Symmetric Traveling Salesman Polytope
Polyhedral results on the stable set problem in graphs containing even or odd pairs
Convergence rate of block-coordinate maximization Burer-Monteiro method for solving large SDPs
On the complexity of approximating the maximal inscribed ellipsoid for a polytope
Linear programming with spheres and hemispheres of objective vectors
Facets of the knapsack polytope
Complexity of chordal conversion for sparse semidefinite programs with small treewidth
Primal and dual convergence of a proximal point exponential penalty method for linear programming
Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption
On the complexity of approximating a KKT point of quadratic programming
Models and algorithms for a staff scheduling problem
FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension
A continuous-time linear complementarity system for dynamic user equilibria in single bottleneck traffic flows
Further results on an abstract model for branching and its application to mixed integer programming
A primal-dual approach to inexact subgradient methods
Oriented Euler complexes and signed perfect matchings
Algorithms for railway crew management
Convex hull representation of the deterministic bipartite network interdiction problem
An extension of the frank and Wolfe method of feasible directions
Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions
Conjugacy in quasi-convex programming
Discrete convexity and polynomial solvability in minimum 0-extension problems
Improved convergence analysis of Lasserre's measure-based upper bounds for polynomial minimization on compact sets
Nonlinear robust optimization via sequential convex bilevel programming
Finite horizon approximations of infinite horizon linear programs
The proximal Chebychev center cutting plane algorithm for convex additive functions
Fast and simple approximation schemes for generalized flow
An optimal randomized incremental gradient method
Minimization of transformed L 1 penalty: theory, difference of convex function algorithm, and robust application in compressed sensing
On the convergence of a class of algorithms using linearly independent search directions
On Q -matrices
Curiosities and counterexamples in smooth convex optimization
Global convergence of the affine scaling methods for degenerate linear programming problems
Two-stage integer programs with stochastic right-hand sides: a superadditive dual approach
An efficient algorithm for minimum k -covers in weighted graphs
Subdifferential representations of risk measures
Partial linear characterizations of the asymmetric travelling salesman polytope
Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2022
Efficiency and implementation of simplicial zero point algorithms
A polynomially bounded algorithm for a singly constrained quadratic program
Orientation-based models for {0, 1, 2}-survivable network design: theory and practice
On the degree and separability of nonconvexity and applications to optimization problems
A local convergence property of primal-dual methods for nonlinear programming
Smoothing methods for nonsmooth, nonconvex minimization
A note on exploiting structure when using slack variables
On superlinear convergence in univariate nonsmooth minimization
The hardness of routing two pairs on one face
A product-form Cholesky factorization method for handling dense columns in interior point methods for linear programming
A note on the Talman, Van der Heyden linear complementarity algorithm
Graphical designs and gale duality
Second-order cover inequalities
On market prices in linear production games
Facets with fixed defect of the stable set polytope
A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming
Sum-of-squares chordal decomposition of polynomial matrix inequalities
New approximations for the cone of copositive matrices and its dual
An exponential lower bound for Zadeh's pivot rule
Nonlinear rescaling and proximal-like methods in convex optimization
On the ergodic convergence rates of a first-order primal-dual algorithm
On a new class of differential variational inequalities and a stability result
Optimality conditions in global optimization and their applications
Polynomially bounded algorithms for locating p -centers on a tree
A method to increase the computational efficiency of certain quadratic programming algorithms
Criss-cross methods: A fresh view on pivot algorithms
A convex polynomial that is not sos-convex
A combinatorial algorithm for computing the rank of a generic partitioned matrix with 2 ˟ 2 submatrices
Correction to: Optimal control of infinite dimensional bilinear systems: application to the heat and wave equations
Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
Variable-Number Sample-Path Optimization
A general framework for handling commitment in online throughput maximization
Convex programming for disjunctive convex optimization
An analysis of the solution set to a homotopy equation between polynomials with real coefficients
Convex extensions and envelopes of lower semi-continuous functions
Simple bilevel programming and extensions
On the Convergence Properties of Hildreth's Quadratic Programming Algorithm
Pseudopower expansion of solutions of generalized equations and constrained optimization problems
On max-k-sums
A set of geometric programming test problems and their solutions
A decoupled first/second-order steps technique for nonconvex nonlinear unconstrained optimization with improved complexity bounds
Accelerated affine-invariant convergence rates of the Frank-Wolfe algorithm with open-loop step-sizes
Convergence of proximal solutions for evolution inclusions with time-dependent maximal monotone operators
On penalty-based bilevel gradient descent method
Quantile-based risk sharing with heterogeneous beliefs
Minimum cost spanning tree games
General Constraint Qualifications in Nondifferentiable Programming
Duality theorem for a generalized Fermat-Weber problem
Semidefinite programming and eigenvalue bounds for the graph partition problem
Online covering with ℓ q -norm objectives and applications to network design
Acceleration of the least p th algorithm for minimax optimization with engineering applications
A linear max - min problem
Challenges in stochastic programming
A Spectral Approach to Polyhedral Dimension
Approximation algorithms for indefinite quadratic programming
Some upper and lower bounds on PSD-rank
Asymptotic behavior of solutions: An application to stochastic NLP
On ternary problems
On solving discrete two-stage stochastic programs having mixed-integer first- and second-stage variables
Further facet generating procedures for vertex packing polytopes
A unifying geometric solution framework and complexity analysis for variational inequalities
Lifted inequalities for $$0\mathord {-}1$$ mixed-integer bilinear covering sets
Approximation bounds for sparse principal component analysis
About the complexity of two-stage stochastic IPs
The effect of calmness on the solution set of systems of nonlinear equations
Permutation congruent transformations of the freudenthal triangulation with minimum surface density
Automated tight Lyapunov analysis for first-order methods
Proving total dual integrality with cross-free families - A general framework
On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming
A branch and cut approach to the cardinality constrained circuit problem
On Douglas-Rachford operators that fail to be proximal mappings
An "out-of-kilter" algorithm for solving minimum cost potential problems
Stability in stochastic programming with recourse-estimated parameters
The sum-of-squares hierarchy on the sphere and applications in quantum information theory
A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
A generic exact solver for vehicle routing and related problems
On the adaptivity gap of stochastic orienteering
Subgradient methods for huge-scale optimization problems
A variation on Karmarkar's algorithm for solving linear programming problems
A stackelberg game approach to distributed spectrum management
Convex graph invariant relaxations for graph edit distance
A characterization of maximal homogeneous-quadratic-free sets
Matrix conditioning and nonlinear optimization
Fairness over time in dynamic resource allocation with an application in healthcare
Time-consistent approximations of risk-averse multistage stochastic optimization problems
A central cutting plane algorithm for the convex programming problem
Characterization of perturbed mathematical programs and interval analysis
A result in surrogate duality for certain integer programming problems
Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization
Error bounds, facial residual functions and applications to the exponential cone
Recent advances in trust region algorithms
On the copositive representation of binary and continuous nonconvex quadratic programs
Absorption paths and equilibria in quitting games
Optimal scaling of balls and polyhedra
Non-convex nested Benders decomposition
Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators
A reformulation-linearization technique for optimization over simplices
Restart procedures for the conjugate gradient method
Hyperbolic 0-1 programming and query optimization in information retrieval
Risk and complexity in scenario optimization
Steiner's problem and fagnano's result on the sphere
A feasible method for optimization with orthogonality constraints
Constraint incorporation in optimization
Stochastic variance-reduced prox-linear algorithms for nonconvex composite optimization
Binary group and Chinese postman polyhedra
An adaptive stochastic sequential quadratic programming with differentiable exact augmented lagrangians
A novel reformulation for the single-sink fixed-charge transportation problem
Two-halfspace closure
First and second-order necessary and sufficient optimality conditions for infinite-dimensional programming problems
A note on the existence of the Alizadeh-Haeberly-Overton direction for semidefinite programming
Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and D.C. Optimization problems
A branch-and-cut algorithm for capacitated network design problems
Null space conditions and thresholds for rank minimization
Note on axiomatic properties of apportionment methods for proportional representation systems
On solving a rank regularized minimization problem via equivalent factorized column-sparse regularized models
A relaxation method for reconstructing objects from noisy X-rays
On the global convergence of path-following methods to determine all solutions to a system of nonlinear equations
Regularities and their relations to error bounds
Dual multilevel optimization
Primal-dual first-order methods with O (1/e) iteration-complexity for cone programming
A geometric analysis of Renegar's condition number, and its interplay with conic curvature
An algorithm for mixed integer optimization
Approximating graph-constrained max-cut
A colorful Steinitz Lemma with application to block-structured integer programs
A column generation algorithm for nonlinear programming
Pareto Adaptive Robust Optimality via a Fourier-Motzkin Elimination lens
A variable-metric variant of the Karmarkar algorithm for linear programming
A polynomial dual simplex algorithm for the generalized circulation problem
Two properties of condition numbers for convex programs via implicitly defined barrier functions
Computable representations for convex hulls of low-dimensional quadratic forms
The extended linear complementarity problem
On average complexity of global optimization problems
Quasi-balanced matrices
Recycling valid inequalities for robust combinatorial optimization with budgeted uncertainty
A multiplier method with automatic limitation of penalty growth
Uncertain convex programs: randomized solutions and confidence levels
Stronger MIP formulations for the Steiner forest problem
On the enumerative nature of Gomory's dual cutting plane method
Computational complexity of a piecewise linear homotopy algorithm
An implementation of some implicit function theorems with applications to sensitivity analysis
Monotone solutions of the parametric linear complementarity problem
Splitting games over finite sets
Equivalence of variational inequality problems to unconstrained minimization
Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems
Correction to: Approximations and generalized Newton methods
Totally balanced games arising from controlled programming problems
On the use of penumbras in blocking and antiblocking theory
Sublinear circuits and the constrained signomial nonnegativity problem
Comparing solution paths of sparse quadratic minimization with a Stieltjes matrix
An interior Newton method for quadratic programming
Towards a Strongly Polynomial Algorithm for Strictly Convex Quadratic Programs: An Extension of Tardos' Algorithm
Efficiency in multiple objective optimization problems
A minimal face constant rank constraint qualification for reducible conic programming
A nonlinear semidefinite optimization relaxation for the worst-case linear optimization under uncertainties
Isotone solutions of parametric linear complementarity problems
Error bounds for monomial convexification in polynomial optimization
Further Applications of a Splitting Algorithm to Decomposition in Variational Inequalities and Convex Programming
Spatial oligopolistic equilibria with arbitrage, shared resources, and price function conjectures
Progress on perfect graphs
Extending the QCR method to general mixed-integer programs
On the polyhedral structure of a multi-item production planning model with setup times
A robust sequential quadratic programming method
Decomposition algorithms for locating minimal cuts in a network
Pegasos: primal estimated sub-gradient solver for SVM
A modification of todd's triangulation J 3
Fractional knapsack problems
A prophet inequality based approach to the adaptive ProbeTop$\varvec{K}$ problem
Regularized Newton method for unconstrained convex optimization
Sequential location-allocation problems on chains and trees with probabilistic link demands
Conditional Value-at-Risk in Stochastic Programs with Mixed-Integer Recourse
A trust region algorithm for nonsmooth optimization
A family of second-order methods for convex ℓ 1 -regularized optimization
Partitioned quasi-Newton methods for nonlinear equality constrained optimization
Augmenting hypergraphs by edges of size two
An O(n 3 L) primal interior point algorithm for convex quadratic programming
Computational experience with a group theoretic integer programming algorithm
Newton's method may fail to recognize proximity to optimal points in constrained optimization
A PL homotopy continuation method with the use of an odd map for the artificial level
Optimization on flag manifolds
Barrier subgradient method
Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping
Duality in vector optimization
How to compute least infeasible flows
Worst-case analysis of clique MIPs
Minimal inequalities
Multiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs
Objective function approximations in mathematical programming
Quasi-polynomial time approximation schemes for assortment optimization under Mallows-based rankings
A primal-dual trust region algorithm for nonlinear optimization
Foreword: special issue on mathematical programming in biology and medicine
Logical analysis of numerical data
A language for nonlinear programming problems
Local branching
The convex recoloring problem: polyhedra, facets and computational experiments
Complete positivity and distance-avoiding sets
The confined primal integral: a measure to benchmark heuristic MINLP solvers against global MINLP solvers
Portfolio construction based on stochastic dominance and target return distributions
Stationary dual prices and depreciation
Unified smoothing approach for best hyperparameter selection problem using a bilevel optimization strategy
On convex envelopes for bivariate functions over polytopes
Structural properties and decomposition of linear balanced matrices
Feasibility issues in a primal-dual interior-point method for linear programming
Finding stationary points on bounded-rank matrices: a geometric hurdle and a smooth remedy
SOCP reformulation for the generalized trust region subproblem via a canonical form of two symmetric matrices
Exact formulas for the proximal/regular/limiting normal cone of the second-order cone complementarity set
A block symmetric Gauss-Seidel decomposition theorem for convex composite quadratic programming and its applications
A greedy algorithm for solving a class of convex programming problems and its connection with polymatroid theory
Optimized first-order methods for smooth convex minimization
Revised dantzig-wolfe decomposition for staircase-structured linear programs
On the width-length inequality
A successive projection method
Policy mirror descent for reinforcement learning: linear convergence, new sampling complexity, and generalized problem classes
A numerically stable dual method for solving strictly convex quadratic programs
Concavity and efficient points of discrete distributions in probabilistic programming
Smoothing methods for convex inequalities and linear complementarity problems
The greedy strategy for optimizing the Perron eigenvalue
An augmented Lagrangian method for optimization problems with structured geometric constraints
Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem
An elementary approach to tight worst case complexity analysis of gradient based methods
Multiobjective bilevel optimization
Penalization in non-classical convex programming via variational convergence
Fine tuning Nesterov's steepest descent algorithm for differentiable convex programming
A class of polynomial variable metric algorithms for linear optimization
Metric regularity of semi-infinite constraint systems
Computational complexity of Van der Heyden's variable dimension algorithm and Dantzig-Cottle's principal pivoting method for solving LCP's
Diagnosing infeasibilities in network flow problems
The quadratic Graver cone, quadratic integer minimization, and extensions
Inverse programming: Theory and examples
Computational experience in sensitivity analysis for nonlinear programming
Linear passive systems and maximal monotone mappings
A characterization for tightness of the sparse Moment-SOS hierarchy
The subdifferential of measurable composite max integrands and smoothing approximation
Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems
On the maximum feasible subsystem problem, IISs and IIS-hypergraphs
Two-stage quadratic integer programs with stochastic right-hand sides
On the convergence of iterative methods for symmetric linear complementarity problems
A Robust Optimization Approach to Dynamic Pricing and Inventory Control with no Backorders
Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix
On the equivalence of the primal-dual hybrid gradient method and Douglas-Rachford splitting
ε-Optimal solutions in nondifferentiable convex programming and some related questions
A likelihood-MPEC approach to target classification
A nonsmooth Newton method for variational inequalities, II: numerical results
A unified stochastic approximation framework for learning in games
Additively decomposed quasiconvex functions
A primal-dual interior point method whose running time depends only on the constraint matrix
Erratum to: Nonlinear programming without a penalty function or a filter
The nucleon of cooperative games and an algorithm for matching games
Preemptive scheduling with rejection
Approximability of average completion time scheduling on unrelated machines
Competitive kill-and-restart and preemptive strategies for non-clairvoyant scheduling
Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs
The condition number of a function relative to a set
Parallel interior-point solver for structured linear programs
Duality gaps in nonconvex stochastic optimization
A second-order method for strongly convex ℓ 1 -regularization problems