The following pages link to Sven Leyffer (Q201787):
Displaying 18 items.
- An Active-Set Method for Second-Order Conic-Constrained Quadratic Programming (Q5502239) (← links)
- The penalty interior-point method fails to converge (Q5717542) (← links)
- A Bilevel Approach for Identifying the Worst Contingencies for Nonconvex Alternating Current Power Systems (Q5853569) (← links)
- A survey of nonlinear robust optimization (Q5882395) (← links)
- Integrating SQP and branch-and-bound for mixed integer nonlinear programming (Q5942943) (← links)
- Nonlinear programming without a penalty function. (Q5957565) (← links)
- Modeling design and control problems involving neural network surrogates (Q6043129) (← links)
- State elimination for mixed‐integer optimal control of partial differential equations by semigroup theory (Q6053745) (← links)
- Practical algorithms for multivariate rational approximation (Q6158843) (← links)
- Learning Symbolic Expressions: Mixed-Integer Formulations, Cuts, and Heuristics (Q6200117) (← links)
- Compact representations of structured BFGS matrices (Q6406503) (← links)
- On Convergence of Binary Trust-Region Steepest Descent (Q6507735) (← links)
- On convergence of binary trust-region steepest descent (Q6567229) (← links)
- Remark on Algorithm 1012: computing projections with large datasets (Q6604165) (← links)
- McCormick envelopes in mixed-integer PDE-constrained optimization (Q6732302) (← links)
- Unifying nonlinearly constrained nonconvex optimization (Q6733225) (← links)
- Modeling and solving cascading failures across interdependent infrastructure systems (Q6737706) (← links)
- A Globally Convergent Method for Computing B-stationary Points of Mathematical Programs with Equilibrium Constraints (Q6764388) (← links)
