yusuke1997/dblp-id-title huggingface dataset:
On interior and convexity conditions, development of dual problems and saddlepoint optimality criteria in abstract mathematical programming
A decomposition property of polyhedra
Parallel optimization for traffic assignment
Merit functions for semi-definite complementarity problems
Regularized nonlinear acceleration
Quantifying low rank approximations of third order symmetric tensors
On conic QPCCs, conic QCQPs and completely positive programs
Block truncated-Newton methods for parallel optimization
Testing of a large-scale network optimization program
Variable metric bundle methods: From conceptual to implementable forms
Semidefinite relaxations for non-convex quadratic mixed-integer programming
Decomposition of test sets in stochastic integer programming
Equilibrium programming: The path following approach and dynamics
Existence of efficient and properly efficient solutions to problems of constrained vector optimization
Evaluating policies in risk-averse multi-stage stochastic programming
Conjugate direction methods with variable storage
Incremental constraint projection methods for variational inequalities
A deep cut ellipsoid algorithm for convex programming: Theory and applications
Finding the nearest point in A polytope
Continuity of the null space basis and constrained optimization
A stability concept for matrix game optimal strategies and its application to linear programming sensitivity analysis
The Chvátal-Gomory procedure for integer SDPs with applications in combinatorial optimization
Efficient branch-and-bound algorithms for weighted MAX-2-SAT
Parallel quasi-Newton methods for unconstrained optimization
Nonlinear programming algorithms using trust regions and augmented Lagrangians with nonmonotone penalty parameters
Optimization with unary functions
An algorithm for nonlinear optimization using linear programming and equality constrained subproblems
The Hirsch Conjecture for the fractional stable set polytope
A primal all-integer algorithm based on irreducible solutions
A nonsmooth version of Newton's method
The factorization approach to large-scale linear programming
Applications of a general convergence theory for outer approximation algorithms
Properties of vertex packing and independence system polyhedra
Optimality and fairness of partisan gerrymandering
Experiments in mixed-integer linear programming using pseudo-costs
Relaxation Methods for Monotropic Programs
Newton's method for linear complementarity problems
Asynchronous block-iterative primal-dual decomposition methods for monotone inclusions
Electrical flows over spanning trees
Advances on strictly Δ-modular IPs
Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
Stochastic global optimization methods part I: Clustering methods
Analysis of a self-scaling quasi-Newton method
Facet of regular 0-1 polytopes
A note on A complementary variant of Lemke's method
Series parallel composition of greedy linear programming problems
A combinatorial algorithm for computing the entire sequence of the maximum degree of minors of a generic partitioned polynomial matrix with 2 ˟ 2 submatrices
Evaluating computational efficiency: A stochastic approach
Parallel variable metric algorithms for unconstrained optimization
Sovability theory for a class of hemivariational inequalities involving copositive plus matrices Applications in robotics
The Augmented Lagrangian Method for Equality and Inequality Constraints in Hilbert Spaces
Linear convergence of the randomized sparse Kaczmarz method
An adaptive augmented Lagrangian method for large-scale constrained optimization
Open questions in complexity theory for numerical optimization
On conditions for optimality of the nonlinear l 1 problem
Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games
On the configuration LP for maximum budgeted allocation
Stationarity conditions and constraint qualifications for mathematical programs with switching constraints
Exchange Price Equilibria and Variational Inequalities
Non-euclidean restricted memory level method for large-scale convex optimization
An integer programming approach for linear programs with probabilistic constraints
Line perfect graphs
Adjustable robust solutions of uncertain linear programs
From coordinate subspaces over finite fields to ideal multipartite uniform clutters
Relative entropy optimization and its applications
Global saddle-point duality for quasi-concave programs
Binary optimal control by trust-region steepest descent
Nonlinear 0-1 programming: II. Dominance relations and algorithms
Fast projection onto the simplex and the l 1 ball
The complementary unboundedness of dual feasible solution sets in convex programming
Generalized convexity on affine subspaces with an application to potential functions
Perfect graphs and norms
Coordinate descent algorithms
On solving simple bilevel programs with a nonconvex lower level program
Global error bounds for piecewise convex polynomials
Computing the inertia from sign patterns
Second order sensitivity analysis and asymptotic theory of parametrized nonlinear programs
Cutoff stability under distributional constraints with an application to summer internship matching
Integer plane multiflow maximisation: one-quarter-approximation and gaps
Robust multicategory support vector machines using difference convex algorithm
A magnetic resonance device designed via global optimization techniques
On the robustness of potential-based flow networks
A robust optimization approach to experimental design for model discrimination of dynamical systems
Note on the computational complexity of j-radii of polytopes in Real n
A geometric approach to cut-generating functions
Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship
Solution of linear least squares via the ABS algorithm
Multicriteria cuts and size-constrained k-cuts in hypergraphs
Stopping criteria for linesearch methods without derivatives
Limiting behavior of the affine scaling continuous trajectories for linear programming problems
A preconditioning proximal Newton method for nondifferentiable convex optimization
Network reinforcement
On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods
Global optimization of univariate Lipschitz functions: II. New algorithms and computational comparison
Recession cones and the domination property in vector optimization
Dynamic knapsack sets and capacitated lot-sizing
Computational Schemes for Large-Scale Problems in Extended Linear-Quadratic Programming
Bilevel programming and the separation problem
Stability of the solution of definite quadratic programs
Note on an extension of "Davidon" methods to nondifferentiable functions
The merchant subtour problem
Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems
Error bounds for convex differentiable inequality systems in Banach spaces
Large-scale semidefinite programs in electronic structure calculation
A time indexed formulation of non-preemptive single machine scheduling problems
Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems
Stopping criteria for, and strong convergence of, stochastic gradient descent on Bottou-Curtis-Nocedal functions
A simple constraint qualification in infinite dimensional programming
Second-order sensitivity analysis in factorable programming: Theory and applications
The upper and lower second order directional derivatives of a sup-type function
Implicit function theorems for mathematical programming and for systems of inequalities
Lexicographic differentiation of nonsmooth functions
Analytical solution of A dynamic transaction flow problem
CP-Rays in Simplicial Cones
Continuous cubic formulations for cluster detection problems in networks
Constraint augmentation in pseudo-singularly perturbed linear programs
Asymmetry in the complexity of the multi-commodity network pricing problem
Complexity estimates of some cutting plane methods based on the analytic barrier
Existence and relaxation for subdifferential inclusions with unbounded perturbation
Approximation and decomposition properties of some classes of locally D.C. functions
Approximating polyhedra with sparse inequalities
On pricing and backward transformation in linear programming
Structures of polyhedra determined by submodular functions on crossing families
A fast combinatorial algorithm for the bilevel knapsack problem with interdiction constraints
Some continuous functions related to corner polyhedra
Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a P-matrix
Discrete optimization on a multivariable boolean lattice
Solving a class of semidefinite programs via nonlinear programming
Arboricity games: the core and the nucleolus
Computational experience with the Chow - Yorke algorithm
Projection methods for non-linear programming
NP-hardness of deciding convexity of quartic polynomials and related problems
On a generalization of the Chvátal-Gomory closure
Minimal cut-generating functions are nearly extreme
Sensitivity analysis in linear programming and semidefinite programming using interior-point methods
Survey of solved and open problems in the degeneracy phenomenon
A trust-region strategy for minimization on arbitrary domains
Testing balancedness and perfection of linear matrices
A note on sufficient conditions for Q 0 and Q 0 AND P 0 matrices
A note on upper Lipschitz stability, error bounds, and critical multipliers for Lipschitz-continuous KKT systems
Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient
Breakpoint searching algorithms for the continuous quadratic knapsack problem
Quadratic regularizations in an interior-point method for primal block-angular problems
An interactive weight space reduction procedure for nonlinear multiple objective mathematical programming
A deterministic rescaled perceptron algorithm
The vertex separator problem: algorithms and computations
Optimizing for strategy diversity in the design of video games
Pruning by isomorphism in branch-and-cut
A class of methods for solving large, convex quadratic programs subject to box constraints
Newton-type methods for non-convex optimization under inexact Hessian information
Second order necessary optimality conditions for minimizing a sup-type function
Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization
Finite master programs in regularized stochastic decomposition
Hessian barrier algorithms for non-convex conic optimization
Stochastic variational inequalities: single-stage to multistage
Finite termination of the proximal point algorithm
Quantitative stability of variational systems: III. epsilon-approximate solutions
A note on a theorem of Yamamuro
Mingling: mixed-integer rounding with bounds
Consistency of finite systems of convex inequalities
Worst-case comparison of valid inequalities for the TSP
Applications of or in the oil industry
A polynomial time interior-point path-following algorithm for LCP based on Chen-Harker-Kanzow smoothing techniques
A continuous variable representation of the traveling salesman problem
Optimally conditioned optimization algorithms without line searches
Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights
Pivot selection methods of the Devex LP code
Problem-based optimal scenario generation and reduction in stochastic programming
Wheel inequalitites for stable set polytopes
Polynomial inequalities representing polyhedra
Variational analysis of the Crouzeix ratio
Erratum to: Minimizing finite sums with the stochastic average gradient
On the complexity of quadratic programming with two quadratic constraints
Branching in branch-and-price: a generic scheme
Extreme optics and the search for Earth-like planets
Principled analyses and design of first-order methods with inexact proximal operators
A solution algorithm for chance-constrained problems with integer second-stage recourse decisions
Approximation algorithms for flexible graph connectivity
Extracting embedded generalized networks from linear programming problems
Bounded linear regularity of convex sets in Banach spaces and its applications
Extra-proximal methods for solving two-person nonzero-sum games
Recognizing underlying sparsity in optimization
Strong substitutes: structural properties, and a new algorithm for competitive equilibrium prices
A class of nonlinear nonseparable continuous knapsack and multiple-choice knapsack problems
Efficient dual simplex algorithms for the assignment problem
The traveling salesman problem: A duality approach
Why random reshuffling beats stochastic gradient descent
Approximating a class of combinatorial problems with rational objective function
Rates of convergence for inexact Krasnosel'skii-Mann iterations in Banach spaces
A Short Proof of the Sticky Face Lemma
A Bifurcation Analysis of the Nonlinear Parametric Programming Problem
Convergence of inertial dynamics and proximal algorithms governed by maximally monotone operators
Solving a class of stochastic mixed-integer programs with branch and price
Lifting two-integer knapsack inequalities
Exact augmented Lagrangian duality for mixed integer linear programming
An implementation of a discretization method for semi-infinite programming
A descent algorithm for nonsmooth convex optimization
Nonlinear complementarity as unconstrained and constrained minimization
Optimized relative step size random searches
Improved sorting-based procedure for integer programming
Convex hull results on quadratic programs with non-intersecting constraints
Bottleneck linear programming
A robust APTAS for the classical bin packing problem
On games corresponding to sequencing situations with ready times
A geometric study of duality gaps, with applications
On equivalent representations of certain multicommodity networks as single commodity flow problems
A generalization of the Frank - Wolfe theorem
Forcing strong convergence of proximal point iterations in a Hilbert space
V-polyhedral disjunctive cuts
Symbolic Fenchel Conjugation
Persistence in discrete optimization under data uncertainty
One-third-integrality in the max-cut problem
Some perturbation theory for linear programming
Quadratic 0/1 optimization and a decomposition approach for the placement of electronic circuits
Orbital branching
Efficient separation routines for the symmetric traveling salesman problem I: general tools and comb separation
Optimality conditions in portfolio analysis with general deviation measures
Convex envelopes of bounded monomials on two-variable cones
A new simplicial variable dimension algorithm to find equilibria on the product space of unit simplices
Facets for the cut cone I
Exact computation of an error bound for the balanced linear complementarity problem with unique solution
A statistical estimate of the structure of multi-extremal problems
Vertex packings: Structural properties and algorithms
The generalized linear complementarity problem revisited
Computational experience with advanced implementation of decomposition algorithms for linear programming
Stable sets and graphs with no even holes
Worst case complexity of direct search under convexity
Randomized first order algorithms with applications to ℓ 1-minimization
A copositive formulation for the stability number of infinite graphs
Q-matrix recognition via secondary and universal polytopes
A BFGS-IP algorithm for solving strongly convex optimization problems with feasibility enforced by an exact penalty approach
Anisotropic proximal gradient
Factorized quasi-Newton methods for nonlinear least squares problems
Perfect zero-one matrices
A bundle-free implicit programming approach for a class of elliptic MPECs in function space
(Robust) Edge-based semidefinite programming relaxation of sensor network localization
Borsuk's theorem through complementary pivoting
Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs
A computational study on robust portfolio selection based on a joint ellipsoidal uncertainty set
A generalization of Löwner-John's ellipsoid theorem
Finding small stabilizers for unstable graphs
An exact duality theory for semidefinite programming and its complexity implications
Finding all efficient extreme points for multiple objective linear programs
Riemannian proximal gradient methods
On minimax optimization problems
Characterization of the barrier parameter of homogeneous convex cones
Bin packing with general cost structures
A doubly stabilized bundle method for nonsmooth convex optimization
Sensitivity analysis of maximally monotone inclusions via the proto-differentiability of the resolvent operator
Maximum semidefinite and linear extension complexity of families of polytopes
Stabilized SQP revisited
On characterizing L 1 -supports, natural and Chebyshev approximates
Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization
Shape derivatives for minima of integral functionals
On averaging and representation properties of the BFGS and related secant updates
On the length of simplex paths: The assignment case
Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
The matricial relaxation of a linear matrix inequality
Variational perspective on local graph clustering
Convergence rates of an inertial gradient descent algorithm under growth and flatness conditions
On the centralization of the circumcentered-reflection method
Exact penalty functions in nonlinear programming
Tropical lower bounds for extended formulations
Error bounds for mixed integer linear optimization problems
A generalization of Polyak's convergence result for subgradient optimization
Smooth over-parameterized solvers for non-smooth structured optimization
New algorithms for constrained minimax optimization
Improving upper bounds for the clique number by non-valid inequalities
An alternative to EM for Gaussian mixture models: batch and stochastic Riemannian optimization
Generalized intersection cuts and a new cut generating paradigm
A bracketing technique to ensure desirable convergence in univariate minimization
A new class of cutting planes for the symmetric travelling salesman problem
Multicommodity network flows: The impact of formulation on decomposition
Optimizing over the first Chvátal closure
On the global convergence of trust region algorithms for unconstrained minimization
Breaking symmetries to rescue sum of squares in the case of makespan scheduling
A QMR-based interior-point algorithm for solving linear programs
Randomness and permutations in coordinate descent methods
Interior-point methods for nonconvex nonlinear programming: orderings and higher-order methods
Formulation of linear problems and solution by a universal machine
Equilibrium, uncertainty and risk in hydro-thermal electricity systems
On weighted multiway cuts in trees
A hybrid approach to discrete mathematical programming
Using copositivity for global optimality criteria in concave quadratic programming problems
A new integer programming formulation of the graphical traveling salesman problem
Shadow prices in nonconvex mathematical programming
The proximity of (algebraic) geometric programming to linear programming
Vector maximisation and lagrange multipliers
A note on node aggregation and Benders' decomposition
Polyhedra related to integer-convex polynomial systems
Resolution and the integrality of satisfiability problems
Erratum to: MIR closures of polyhedral sets
On the extended linear complementarity problem
An upper bound on the expectation of simplicial functions of multivariate random variables
On the convexifiability of pseudoconvex C 2 -functions
Partially finite convex programming, Part I: Quasi relative interiors and duality theory
A note on the blocker of tours
Asynchronous parallel algorithms for nonconvex optimization
On self-concordant barrier functions for conic hulls and fractional programming
Random Linkage: a family of acceptance/rejection algorithms for global optimisation
Efficient, certifiably optimal clustering with applications to latent variable graphical models
A relaxed constant positive linear dependence constraint qualification and applications
The Steiner tree problem II: Properties and classes of facets
An example of stability for the minima of a sequence of dc functions: Homogenization for a class of nonlinear Sturm-Liouville problems
Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
Minimum cardinality non-anticipativity constraint sets for multistage stochastic programming
New approaches for optimizing over the semimetric polytope
Efficient robust optimization for robust control with constraints
Even more with the Lemke complementarity algorithm
Primal and dual linear decision rules in stochastic and robust optimization
Phase recovery, MaxCut and complex semidefinite programming
Convex relaxations of non-convex mixed integer quadratically constrained programs: extended formulations
The estimation of the hessian matrix in nonlinear least squares problems with non-zero residuals
A tight approximation algorithm for the cluster vertex deletion problem
Polytopes associated with symmetry handling
Relaxation methods for problems with strictly convex separable costs and linear constraints
r -convex functions
Regional complexity analysis of algorithms for nonconvex smooth optimization
A numerical method for a class of continuous concave programming problems
Weighted Triangle-free 2-matching Problem with Edge-disjoint Forbidden Triangles
Sampling Kaczmarz-Motzkin method for linear feasibility problems: generalization and acceleration
Piecewise linear paths to minimize convex functions may not be monotonic
An optimal variant of Kelley's cutting-plane method
Weakly homogeneous variational inequalities and solvability of nonlinear equations over cones
Risk adjusted discounted cash flows in capacity expansion models
A generalized linear production model: A unifying model
Single source unsplittable flows with arc-wise lower and upper bounds
A first order characterization of generalized monotonicity
Stochastic programming duality: 8 multipliers for unbounded constraints with an application to mathematical finance
An approximation algorithm for the generalized assignment problem
An O(n 3 L) primal-dual potential reduction algorithm for solving convex quadratic programs
Quantitative stability analysis for minimax distributionally robust risk optimization
Detecting symmetries by branch & cut
An interior point method, based on rank-1 updates, for linear programming
Lifting for conic mixed-integer programming
Dynamic stochastic approximation for multi-stage stochastic optimization
A new linesearch algorithm for nonlinear least squares problems
Decomposition of arborescent linear programs
Conditioning of linear-quadratic two-stage stochastic optimization problems
Conical projection algorithms for linear programming
On the complexity of the planar directed edge-disjoint paths problem
Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms
Exploiting structure in piecewise-linear homotopy algorithms for solving equations
Sensitivity analysis framework for variational inequalities
Some classes of matrices in linear complementarity theory
Spectral operators of matrices
Strong Abadie CQ, ACQ, calmness and linear regularity
On convergence of iterative thresholding algorithms to approximate sparse solution for composite nonconvex optimization
An outer approximate subdifferential method for piecewise affine optimization
Weak sharp minima revisited, part II: application to linear regularity and error bounds
Submodular function minimization and polarity
Multidimensional sum-up rounding for integer programming in optimal experimental design
Solving (large scale) matching problems combinatorially
The permutahedron of N-sparse posets
Mixed Integer Models for the Stationary Case of Gas Network Optimization
Tight representation of logical constraints as cardinality rules
Graph coloring with decision diagrams
Sandwich games