Scientific Program Cluster Details

Program -> Parallel Sessions -> Cluster List -> Details all clusters
Search talks included | sessions only


Please login, if you want to personalize your selection of clusters.

Cluster: Nonlinear programming

Monday


10:30 - 12:00, room: H 0107

Chair: Jean-Pierre Dussault
Methods for nonlinear optimization I

Liu How does the linear independence assumption affect algorithms of nonlinear constrained optimization [...]
Mommer A nonlinear preconditioner for experimental design problems [...]
Dussault The behaviour of numerical algorithms without constraint qualifications [...]

 

10:30 - 12:00, room: H 0110

Chair: Frank E. Curtis and Daniel Robinson
Nonlinear optimization I

Eckstein Alternating direction methods and relative error criteria for augmented Lagrangians [...]
Chin A family of second order methods for L1 convex optimization [...]
Solntsev Dynamic batch methods for L1 regularized problems and constrained optimization [...]

 

10:30 - 12:00, room: H 0112

Chair: Dennis Janka
Algorithms for optimal control I

Janka Separable formulations of optimum experimental design problems [...]
Hatz Hierarchical dynamic optimization - Numerical methods and computational results for estimating parameters in optimal control problems [...]
Gräser Truncated nonsmooth newton multigrid methods for nonsmooth minimization [...]

 

13:15 - 14:45, room: H 0107

Chair: Csizmadia Zsolt
Methods for nonlinear optimization II

Gorka Parallel direction finding algorithm in method of feasible directions [...]
Hungerford Edge directions in polyhedral optimization [...]
Zsolt Pros and cons of first order methods for solving general nonlinear problems [...]

 

13:15 - 14:45, room: H 0110

Chair: Frank E. Curtis and Daniel Robinson
Nonlinear optimization II

Robinson A primal-dual active-set method for convex QP [...]
Leyffer Large-scale nonlinear optimization solvers [...]
Wong Regularized quadratic programming methods for large-scale SQP [...]

 

13:15 - 14:45, room: H 0112

Chair: Shuzhong Zhang
Structures, complexities, and eigenvalues of tensor forms and polynomial functions

Zhang Cones of nonnegative quartic polynomial functions and their applications [...]
Lim 3-tensors as the boundary of tractability [...]
Yang Some properties of tensors’ eigenvalues and related optimization problem [...]

 

15:15 - 16:45, room: H 0107

Chair: Masoud Ahookhosh
Methods for nonlinear optimization III

Shen New augmented lagrangian-based proximal point algorithms for convex optimization with equality constraint [...]
Al-Baali Hybrid damped-BFGS/Gauss-Newton methods for nonlinear least-squares [...]
Ahookhosh An improved nonmonotone technique for both line search and trust-region frameworks [...]

 

15:15 - 16:45, room: H 0110

Chair: Frank E. Curtis and Daniel Robinson
Nonlinear optimization III

Solodov Convergence properties of augmented Lagrangian methods under the second-order sufficient optimality condition [...]
Curtis Infeasibility detection in nonlinear optimization [...]
Oztoprak Two-phase active set methods with applications to inverse covariance estimation [...]

 

15:15 - 16:45, room: H 0112

Chair: Roummel Marcia
Unconstrained optimization I

Babaie-Kafaki A modification on the Hager-Zhang conjugate gradient method [...]
Odland On the relationship between quasi-Newton methods and the conjugate [...]
Marcia Limited-memory BFGS with diagonal updates [...]

 

 

Tuesday


10:30 - 12:00, room: H 0107

Chair: Hans-Bernd Dürr
Methods for nonlinear optimization IV

Tannier Block diagonal preconditioners using spectral information for saddle-point systems [...]
Dürr Continuous-time saddle point algorithms with applications in control [...]

 

10:30 - 12:00, room: H 0110

Chair: Frank E. Curtis and Daniel Robinson
Nonlinear optimization IV

Fowkes Global optimization of Lipschitz continuous functions [...]
Fletcher On trust regions and projections for an SLCP algorithm for NLP [...]
Erway Quasi-Newton methods for solving the trust-region subproblem [...]

 

10:30 - 12:00, room: H 0112

Chair: Victor M. Zavala and Sebastian Sager
Real-time optimization I

Ferreau The ACADO code generation tool for high-speed model predictive control and moving horizon estimation [...]
Frasch Fast mixed-level iteration schemes for nonlinear model predictive control on multicore architectures [...]
Diehl Real-time optimization of large distributed systems [...]

 

13:15 - 14:45, room: H 0107

Chair: Marco Rozgic
Methods for nonlinear optimization V

Jaraczewski Interior point methods for a new class of minimum energy point systems on smooth manifolds [...]
Rozgic Interior point methods for the optimization of technological forming processes [...]

 

13:15 - 14:45, room: H 0110

Chair: Frank E. Curtis and Daniel Robinson
Nonlinear optimization V

Ridzal A matrix-free trust-region SQP algorithm for large-scale optimization [...]
Forsgren Inexact Newton methods with applications to interior methods [...]
Zhou Numerical experience of a primal-dual active set method and its improvement [...]

 

13:15 - 14:45, room: H 0112

Chair: Victor M. Zavala and Sebastian Sager
Real-time optimization II

Anitescu Scalable dynamic optimization [...]
Kirches A real-time iteration scheme for mixed-integer nonlinear model predictive control [...]
Borrelli Real-time stochastic predictive control applied to building control systems [...]

 

15:15 - 16:45, room: H 0107

Chair: Mouna Ali Hassan
Interior-point methods

Liao A study of the dual affine scaling continuous trajectories for linear programming [...]
Kato An interior point method with a primal-dual quadratic barrier penalty function for nonlinear semidefinite programming [...]
Hassan The l1- Penalty Interior Point Method [...]

 

15:15 - 16:45, room: H 0110

Chair: Andrew R. Conn
Recent advances in nonlinear optimization

Gould SQP Filter methods without a restoration phase [...]
Gill Regularization and convexification for SQP methods [...]
Waechter A hot-started NLP solver [...]

 

15:15 - 16:45, room: H 0112

Chair: Victor M. Zavala and Sebastian Sager
Real-time optimization III

Kögel On real-time optimization for model predictive control using multiplier methods and Nesterov’s gradient method [...]
Pannocchia On the convergence of numerical solutions to the continuous-time constrained LQR problem [...]
Kerrigan Breaking away from double-precision floating-point in interior point solvers [...]

 

 

Wednesday


10:30 - 12:00, room: H 0107

Chair: Jacek Gondzio
Regularization techniques in optimization I

Gondzio Recent advances in the matrix-free interior point method [...]
Armand A boundedness property of the Jacobian matrix arising in regularized interior-point methods [...]
Saunders QPBLUR: A regularized active-set method for sparse convex quadratic programming [...]

 

10:30 - 12:00, room: H 0110

Chair: Henry Wolkowicz and Ting Kei Pong
Trust-region methods and nonlinear programming

Yuan Optimality conditions and smoothing trust region newton method for non-lipschitz optimization [...]
Pong Generalized trust region subproblem: Analysis and algorithm [...]
Cheung Solving a class of quadratically constrained semidefinite prgramming problems with application to structure based drug design problem [...]

 

10:30 - 12:00, room: H 0112

Chair: Shuzhong Zhang
Solution methods for matrix, polynomial, and tensor optimization

Liu Beyond heuristics: Applying alternating direction method of multiplier method in solving matrix factorization problems [...]
Li Maximum block improvement and polynomial optimization [...]

 

13:15 - 14:45, room: H 0107

Chair: Jacek Gondzio
Regularization techniques in optimization II

Bellavia Regularized Euclidean residual algorithm for nonlinear least-squares with strong local convergence properties [...]
Morini Preconditioning of sequences of linear systems in regularization techniques for optimization [...]
Gratton Preconditioning inverse problems using duality [...]

 

13:15 - 14:45, room: H 0112

Chair: Marc C. Steinbach
Applications of optimization I

Yamashita An approach based on shortest path and connectivity consistency for sensor network localization problems [...]
Patriksson Nonlinear continuous resource allocation - A numerical study [...]
Steinbach Estimating material parameters by X-ray diffraction [...]

 

15:15 - 16:45, room: H 0107

Chair: José Mario Martínez
Line-search strategies

Birgin Spectral projected gradients: Reviewing ten years of applications [...]
Santos An adaptive spectral approximation-based algorithm for nonlinear least-squares problems [...]
Krejic Nonmonotone line search methods with variable sample sizes [...]

 

15:15 - 16:45, room: H 0112

Chair: Alina Fedossova
Applications of optimization II

Göllner Geometry optimization of branched sheet metal products [...]
Fedossova Modeling of transboundary pollutant displacement for groups of emission sources [...]

 

 

Thursday


10:30 - 12:00, room: H 0107

Chair: Dominique Orban
Linear algebra for optimization

Stoll Preconditioning for time-dependent PDE-constrained optimization problems [...]
Akle Preconditioning for iterative computation of search directions within interior methods for constrained optimization [...]
Orban Spectral analysis of matrices arising in regularized interior-point methods [...]

 

10:30 - 12:00, room: H 0112

Chair: Ganesh Perumal
Convex nonlinear optimization I

Stefanov Convex separable minimization with box constraints [...]
Perumal A decomposition technique for convex optimization problems [...]

 

13:15 - 14:45, room: H 0107

Chair: Ya-xiang Yuan
Algorithms and applications I

Cartis On the evaluation complexity of constrained nonlinear programming [...]
Wang An augmented Lagrangian trust region method for nonlinear programming [...]
Wu Computation of optimal strategies for evolutionary games [...]

 

13:15 - 14:45, room: H 0110

Chair: Luiz-Rafael Santos
Interior-point methods for linear programming

Oliveira Continued iteration and simple algorithms on interior point methods for linear programming [...]
Casacio New preconditioners for interior point methods in linear programming [...]
Santos A polynomial optimization subproblem in interior-point methods [...]

 

13:15 - 14:45, room: H 0112

Chair: Ibraheem Alolyan
Semidefinite and DC programming

Alolyan Zeros of quadratic interval polynomials [...]

 

15:15 - 16:45, room: H 0107

Chair: Ya-xiang Yuan
Algorithms and applications II

Fan Accelerating the modified Levenberg-Marquardt method [...]
Wang Optimizing inversion methods for seismic imaging [...]
Bosse Limited memory updating and quadratic overestimation for NLOP [...]

 

15:15 - 16:45, room: H 0110

Chair: Jiawang Nie
Polynomial optimization and semidefinite programming

Zhi Computing real solutions of polynomial systems via low-rank moment matrix completion [...]
Riener Symmetry in polynomial optimization [...]
Schweighofer The sums of squares dual of a semidefinite program [...]

 

15:15 - 16:45, room: H 0112

Chair: Michal Kocvara
Nonlinear multilevel and domain decomposition methods in optimization

Dostal Optimal massively parallel algorithms for large QP/QPQC problems arising in mechanics [...]
Turner Applications of domain decomposition to topology optimization [...]
Krause Inherently nonlinear decomposition and multilevel strategies for non-convex minimization [...]

 

 

Friday


10:30 - 12:00, room: H 0107

Chair: José Mario Martínez
Optimality conditions and constraint qualifications

Maciel A trust region algorithm for the nonconvex unconstrained vector optimization problem [...]
Silva Constant positive generators: A new weak constraint qualification with algorithmic applications [...]
Srivastav Fritz John duality in the presence of equality and inequality constraints [...]

 

10:30 - 12:00, room: H 0112

Chair: Jianming Shi
Complexity issues in optimization

König Norm maximization is W[1]-hard [...]
Santiago An efficient algorithm for the projection of a point on the intersection of two hyperplanes and a box in Rn [...]
Shi A computational geometric approach for solving linear programming: Toward strong polynomial [...]

 

13:15 - 14:45, room: H 0107

Chair: Diethard Klatte
Stability and solution methods

Klatte Metric regularity versus strong regularity for critical points of nonlinear programs [...]
Bütikofer Influence of inexact solutions in a lower level problem on the convergence behavior of a nonsmooth newton method [...]
Kummer Newton schemes for functions and multifunctions [...]

 

13:15 - 14:45, room: H 0112

Chair: Feyzullah Ahmetoğlu
Optimality conditions I

Ahmetoğlu Necessary conditions for a convex programming problem in Banach spaces partially ordered by a cone with empty interior [...]

 

13:15 - 14:45, room: MA 004

Chair: William Hager
Fast gradient methods for nonlinear optimization and applications I

Hongchao An adaptive preconditioned nonlinear conjugate gradient method with limited memory [...]
Diao A sequential quadratic programming method without a penalty function or a filter for general nonlinear constrained optimization [...]
Toraldo On the use of spectral properties of the steepest descent method [...]

 

15:15 - 16:45, room: H 0107

Chair: Oleg Burdakov
Decomposition and relaxation methods

Louveaux Relaxation schemes for the evaluation of a policy in batch mode reinforcement learning [...]
Burdakov An approach to solving decomposable optimization problems with coupling constraints [...]

 

15:15 - 16:45, room: H 0112

Chair: Alexander Strekalovskiy
Optimality conditions II

Naffouti On the second order optimality conditions for optimization problems with inequality constraints [...]
Strekalovskiy New mathematical tools for new optimization problems [...]

 

15:15 - 16:45, room: MA 004

Chair: William Hager
Fast gradient methods for nonlinear optimization and applications II

Liu Max-min fairness linear transceiver design for a multi-user MIMO interference channel [...]
Hager A primal-dual active set algorithm for nonlinear optimization with polyhedral constraints [...]
Dai A perfect example for the BFGS method [...]

 

 

Program -> Parallel Sessions -> Cluster List -> Details all clusters
Search talks included | sessions only
  There are three major facts that should be watched out for in all payday loans in the United States. In this section we give only a brief summary recommendation for admission of Cheap Levitra. Full information can be found in the instructions for receiving medications with vardenafil.