2009 年 SCI 收录我校师生论文一览 （共 122 篇） 1. 标题: Duality gap of the conic convex constrained optimization problems in normed

Source URL: lib.hrbust.edu.cn

CS261: A Second Course in Algorithms Lecture #9: Linear Programming Duality (Part 2)∗ Tim Roughgarden† February 2,

Source URL: theory.stanford.edu

• Mathematical optimization
• Convex optimization
• Linear programming
• Operations research
• Duality
• Weak duality
• Strong duality
• Constraint
• Duality gap
• Semidefinite programming

34 Introduction to Semidefinite Programming Key Properties of LP that do not extend to SDP • There may be a finite or infinite duality gap. The primal and/or dual may

Source URL: www.math.nus.edu.sg

Subdifferentiability and the Duality Gap Neil E. Gretsky () ∗ Department of Mathematics, University of California, Riverside

Source URL: www.econ.ucla.edu

Interior Point Algorithms for Large-Scale Nonlinear Programming: Theory and Algorithmic Development ¨ Andreas Wachter IBM T.J. Watson Research Center

Source URL: www.fields.utoronto.ca

• Nonlinear programming
• Optimal control
• Linear programming
• Interior point method
• Partial differential equation
• Constraint
• Convex function
• Sequential quadratic programming
• Duality gap
• Mathematical optimization
• Mathematical analysis
• Mathematics

1 Zero Duality Gap in Optimal Power Flow Problem Javad Lavaei and Steven H. Low Abstract—The optimal power flow (OPF) problem is nonconvex

Source URL: netlab.caltech.edu

• Duality
• Linear programming
• Semidefinite programming
• Quadratic programming
• Convex optimization
• Relaxation
• Strong duality
• Interior point method
• Optimization problem
• Mathematical optimization
• Mathematical analysis
• Operations research

Primal-Dual Interior Point algorithms for Linear Programming George Tzallas-Regas Interior point methods were widely used in the past in the form of barrier methods. In linear programming, the simplex method dominated, m

Source URL: www.doc.ic.ac.uk

• Numerical analysis
• Linear programming
• Interior point method
• Duality gap
• Duality
• Karush–Kuhn–Tucker conditions
• Simplex algorithm
• Semidefinite programming
• Quadratic programming
• Mathematical optimization
• Operations research
• Convex optimization

Optimal investment and contingent claim valuation in illiquid markets Teemu Pennanen King’s College London Ari-Pekka Perkki¨o

Source URL: www.kcl.ac.uk

• Operations research
• Mathematical analysis
• Probability space
• Probability theory
• Duality gap
• Duality
• Applied mathematics
• Convex optimization
• Linear programming
• Mathematical optimization

PDF Document

Source URL: wwwhome.math.utwente.nl

• Convex optimization
• Linear programming
• Operations research
• Duality gap
• Duality
• Function
• Vector space
• Transportation theory
• Mathematics
• Algebra
• Mathematical optimization