A full step Newton method for the solution of a nonlinear magnetostatic optimization problem

被引:2
|
作者
Brandstätter, B
Magele, C
Ring, W
机构
[1] Inst Fundamentals & Theory Elect Engn, A-8010 Graz, Austria
[2] Graz Tech Univ, Math Inst, A-8010 Graz, Austria
关键词
magnetostatics; Newton method; nonlinear magnetics; optimization methods;
D O I
10.1109/20.952579
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
We consider a nonlinear magnetostatic field problem, where in a certain subdomain a cost functional (i.e., the magnetic field has to fulfill a prescribed figure) is defined. The optimization problem is stated in such a way that the field problem is treated as a constraint. A Lagrange function is established depending on the magnetic vector potential A, the current density J in coil segments and the vector of Lagrange multipliers lambda. The derivatives with respect to the variables are set to zero to obtain the optimality system. The optimality system is solved applying full Newton steps without line search. For the left hand side of the Newton system the second derivatives of the Lagrange function are required while the first derivatives of the Lagrange function are written into the right hand side. Employing a finite element scheme to discretize the problem domain, we end up with a linear system of equations that has to be solved for each Newton step.
引用
收藏
页码:3212 / 3215
页数:4
相关论文
共 50 条
  • [41] An infeasible interior-point algorithm with full-Newton step for linear optimization
    Liu, Zhongyi
    Sun, Wenyu
    NUMERICAL ALGORITHMS, 2007, 46 (02) : 173 - 188
  • [42] An infeasible interior-point algorithm with full-Newton step for linear optimization
    Zhongyi Liu
    Wenyu Sun
    Numerical Algorithms, 2007, 46 : 173 - 188
  • [43] A generalized projection quasi‐Newton method for nonlinear optimization problems
    Y. Lai
    Z. Gao
    G. He
    Annals of Operations Research, 1999, 87 : 353 - 362
  • [44] A quasi-Newton method in shape optimization for a transmission problem
    Kunstek, Petar
    Vrdoljak, Marko
    OPTIMIZATION METHODS & SOFTWARE, 2022, 37 (06): : 2273 - 2299
  • [45] A modified Quasi-Newton method for vector optimization problem
    Ansary, Md A. T.
    Panda, G.
    OPTIMIZATION, 2015, 64 (11) : 2289 - 2306
  • [46] Subspace Newton method for sparse group ℓ0 optimization problem
    Liao, Shichen
    Han, Congying
    Guo, Tiande
    Li, Bonan
    JOURNAL OF GLOBAL OPTIMIZATION, 2024, 90 (01) : 93 - 125
  • [47] A Newton-bracketing method for a simple conic optimization problem
    Kim, Sunyoung
    Kojima, Masakazu
    Toh, Kim-Chuan
    OPTIMIZATION METHODS & SOFTWARE, 2021, 36 (2-3): : 371 - 388
  • [48] An improved full-Newton step O(n) infeasible interior-point method for horizontal linear complementarity problem
    Kheirfam, Behrouz
    NUMERICAL ALGORITHMS, 2016, 71 (03) : 491 - 503
  • [49] Problem solving with a method - A step-by-step guide for a journey from the problem to the solution
    Probleme lösen mit Methode: Eine Schritt-für-Schritt Navigation für eine Reise vom Problem zur Lösung
    1600, Carl Hanser Verlag (111):
  • [50] An improved full-Newton step O(n) infeasible interior-point method for horizontal linear complementarity problem
    Behrouz Kheirfam
    Numerical Algorithms, 2016, 71 : 491 - 503