NUMERICAL SOLUTION OF A CLASS OF NON-CONVEX VARIATIONAL PROBLEMS BY SQP
From MaRDI portal
Publication:4787841
DOI10.1081/NFA-120014752zbMath1026.49024OpenAlexW1987785185MaRDI QIDQ4787841
Publication date: 30 November 2003
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1081/nfa-120014752
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Numerical methods of relaxation type (49M20)
Related Items
Linear-programming approach to nonconvex variational problems ⋮ Coarse-Convex-Compactification Approach to Numerical Solution of Nonconvex Variational Problems ⋮ Descent-Penalty Methods for Relaxed Nonlinear Elliptic Optimal Control Problems
Cites Work
- Unnamed Item
- Numerical analysis of oscillations in nonconvex problems
- A nonconvex variational problem related to change of phase
- Gradient Young measures generated by sequences in Sobolev spaces
- An anti-plane shear problem
- On the numerical analysis of non-convex variational problems
- Numerical approximation of Young measures in non-convex variational problems
- Finite element approximation of a microstructure evolution
- Approximated Convex Envelope of a Function
- A necessary and sufficient condition for nonattainment and formation of microstructure almost everywhere in scalar variational problems
- The lack of lower semicontinuity and nonexistence of minimizers
- Numerical solution of the scalar double-well problem allowing microstructure
- Numerical approximation of parametrized measures
- On minima of a functional of the gradient: necessary conditions